In this paper, we define the concept of generalized Fibonacci polynomial of a graph \(G\) which gives the total number of all \(k\)-stable sets in generalized lexicographical products of graphs. This concept generalizes the Fibonacci polynomial of a graph introduced by G. Hopkins and W. Staton in [3].

A Fibonacci string of order \(n\) is a binary string of length \(n\) with no two consecutive ones. The Fibonacci cube \(\Gamma_n\) is the subgraph of the hypercube \(Q_n\) induced by the set of Fibonacci strings of order \(n\). For positive integers \(i, n\), with \(n \geq i\), the \(i\)th extended Fibonacci cube is the vertex-induced subgraph of \(Q_n\) for which \(V(\Gamma_{i}^{n}) = V_i\) is defined recursively by

\[V_{n+2}^{i} = 0 V_{n+1}^{i} + 10V_n^{i},\]

with initial conditions \(V_i^i = B_i, V_{i+1}^{i} = B_{i+1}\), where \(B_k\) denotes the set of binary strings of length \(k\). In this study, we answer in the affirmative a conjecture of Wu [10] that the sequences \(\{|V_n^i|\}_{i={1+2}}^\infty\) are pairwise disjoint for all \(i \geq 0\), where \(V_n^0 = V(\Gamma_n)\).

Let \(S\) be a simple polygon in the plane whose vertices may be partitioned into sets \(A’, B’\), such that for every two points of \(A’\) (of \(B’\)), the corresponding segment is in \(S\). Then \(S\) is a union of \(6\) (or possibly fewer) convex sets. The number \(6\) is best possible. Moreover, the simple connectedness requirement for set \(S\) cannot be removed.

An \(\lambda\)-design on \(v\) points is a set of \(v\) distinct subsets (blocks) of a \(v\)-element set (points) such that any two different blocks meet in exactly \(\lambda\) points and not all of the blocks have the same size. Ryser’s and Woodall’s \(\lambda\)-design conjecture states that all \(\lambda\)-designs can be obtained from symmetric designs by a certain complementation procedure. The main result of the present paper is that the \(\lambda\)-design conjecture is true when \(v = 8p + 1\), where \(p \equiv 1\) or \(7\) (mod \(8\)) is a prime number.

For an ordered set \(W = \{w_1, w_2, \ldots, w_e\}\) of vertices and a vertex \(v\) in a connected graph \(G\), the representation of \(v\) with respect to \(W\) is the \(e\)-vector \(r(v|W) = (d(v, w_1), d(v, w_2), \ldots, d(v, w_k))\), where \(d(x, y)\) represents the distance between the vertices \(x\) and \(y\). The set \(W\) is a resolving set for \(G\) if distinct vertices of \(G\) have distinct representations with respect to \(W\). A resolving set for \(G\) containing a minimum number of vertices is a basis for \(G\). The dimension \(\dim(G)\) is the number of vertices in a basis for \(G\). A resolving set \(W\) of \(G\) is connected if the subgraph \(\langle W \rangle\) induced by \(W\) is a connected subgraph of \(G\). The minimum cardinality of a connected resolving set in a graph \(G\) is its connected resolving number \(cr(G)\). The relationship between bases and minimum connected resolving sets in a graph is studied. A connected resolving set \(W\) of \(G\) is a minimal connected resolving set if no proper subset of \(W\) is a connected resolving set. The maximum cardinality of a minimal connected resolving set is the upper connected resolving number \(cr^+(G)\). The upper connected resolving numbers of some well-known graphs are determined. We present a characterization of nontrivial connected graphs of order \(n\) with upper connected resolving number \(n-1\). It is shown that for a pair \(a,b\) of integers with \(1 \leq a \leq b\) there exists a connected graph \(G\) with \(cr(G) = a\) and \(cr^+(G) = b\) if and only if \((a,b) \neq (1,4)\) for all \(i > 2\).

We give six improved bounds on \(A(n,d,w)\), the maximum cardinality of a binary code of length \(n\) with minimum distance \(d\) and constant weight \(w\).

In this paper, we show that if \(G\) is an “\(\alpha\)-labeled” graph and if \(H\) is a “pseudograceful” graph, then \(G \cup H\) can be graceful or “pseudograceful” under some conditions on the \(\alpha\)-labeling function of \(G\). This generalizes Theorem 2.1 of [21]. We also show that if \(G\) is a Skolem-graceful, then \(G + \overline{K_n}\) is graceful for all \(n \geq 1\). We also give a partial answer to the question in [1] about the gracefulness of \(\overline{K_n} + mK_2\) for \(m \geq 3\). Finally, we complete the characterization of graceful graphs in the family \(C_m \cup S_n\).

We study the discrete version of the \(p\)-Laplacian operator — \(\textrm{div}(|\nabla u|^{p-2}\nabla u)\) — and we give some estimates of its smallest positive eigenvalue. In earlier papers, eigenvalues of the discrete Laplacian have been considered. We shall here study more general means. We shall also, in particular, study the case when the graph is complete. We give an estimate of the smallest positive eigenvalue of the \(p\)-Laplacian when the graph is a subgraph of \(\mathbb{Z}^n\) in this context. We give all eigenvalues of the \(p\)-Laplacian when the graph is complete.

Bipartite permutation graphs have several nice characterizations in terms of vertex ordering. Besides, as AT-free graphs, they have a linear structure in the sense that any connected bipartite permutation graph has a dominating path. In the present paper, we elaborate the linear structure of bipartite permutation graphs by showing that any connected graph in the class can be stretched into a “path” with “edges” being chain graphs. A particular consequence from the obtained characterization is that the clique-width of bipartite permutation graphs is unbounded, which refines a recent result of Golumbic and Rotics for permutation graphs.

A known result due to Matthews and Sunner is that every \(2\)-connected claw-free graph on \(n\) vertices contains a cycle of length at least \(\min\{2\delta+4,n\}\), and is Hamiltonian if \(n \leq 3\delta+2\). In this paper, we show that every \(2\)-connected claw-free graph on \(n\) vertices which does not belong to one of three classes of exceptional graphs contains a cycle of length at least \(\min\{4\delta-2,n\}\), hereby generalizing several known results. Moreover, the bound \(4\delta-2\) is almost best possible.