A graph \(G\) is \(N^m\)-locally connected if for every vertex \(v\) in \(G\), the vertices not equal to \(v\) and with distance at most \(m\) to \(v\) induce a connected subgraph in \(G\). In this note, we first present a counterexample to the conjecture that every \(3\)-connected, \(N^2\)-locally connected claw-free graph is hamiltonian and then show that both connected \(N^2\)-locally connected claw-free graph and connected \(N^3\)-locally connected claw-free graph with minimum degree at least three have connected even \([2, 4]\)-factors.

In J.-P. Serre’s \(Lettre \;à\; M. Tsfasman\) \([3]\), an interesting bound for the maximal number of points on a hypersurface of the \(n\)-dimensional projective space \(PG(n,q)\) over the Galois field \(GF(q)\) with \(q\) elements is given. Using essentially the same combinatorial technique as in \([3]\), we provide a bound which is relative to the maximal dimension of a subspace of \(PG(n,q)\) which is completely contained in the hypersurface. The lower that dimension, the better the bound. Next, by using a different argument, we derive a bound which is again relative to the maximal dimension of a subspace of \(PG(n, q)\) which is completely contained in the hypersurface, If that dimension increases for the latter case, the bound gets better.
As such, the bounds are complementary.

In this paper, it is shown that a variation of banana trees is odd graceful, and it is also proved that the variation of banana is graceful and \(\hat{p}\)-labeling in some cases.

In this paper, we consider the generalized Fibonacci and Pell Sequences and then show the relationships between the generalized Fibonacci and Pell sequences, and the Hessenberg permanents and determinants.

In this paper, a sequence representation of Dyck paths is presented, which yields a sequence representation of the Dyck path poset \({D}\) ordered by pattern containment. This representation makes it clear that the Dyck path poset \({D}\) takes the composition poset investigated by Sagan and Vatter as a subposet, and that the pattern containment order on Dyck paths exactly agrees with a generalized subword order also presented by Sagan and Vatter. As applications of the representation, we describe the Möbius function of \({D}\) and establish the Möbius inverse of the rank function of \({D}\) in terms of Dyck sequences. In the end, a Sperner and unimodal subposet of \({D}\) is given.

A graph is said to be determined by its adjacency spectrum (or to be a DS graph, for short) if there is no other non-isomorphic graph with the same adjacency spectrum. Although all connected graphs of index less than \(2\) are known to be determined by their adjacency spectra, the classification of DS graphs of index less than \(2\) is not complete yet. The purpose of this paper is to characterize all DS graphs of index less than \(2\) with no \(Z_n\) as a component.

Let \(B\) be a bipartite graph. We obtain two new results as follows:(1) Suppose that \(u \in V(B)\) is a vertex such that \(N_B(u)\) contains at least \(|N_B(u)| – 1\) odd vertices. Let \(f : V(B) \to \mathbb{N}\) be the function such that \(f(u) = 1\) and \(f(v) = \lceil d_B(v)/2 \rceil + 1\) for \(v \in V(B) \setminus u\). Then \(B\) is \(f\)-choosable.(2) Suppose that \(u \in V(B)\) is a vertex such that every vertex in \(N_B(u)\) is odd, and \(v \in V(B)\) is an odd vertex that is not adjacent to \(u\). Let \(f : V(B) \to \mathbb{N}\) be the function such that \(f(u) = 1\), \(f(v) = \lceil d_B(v)/2 \rceil\), and \(f(w) = \lceil d_B(w)/2 \rceil + 1\) for \(w \in V(B) \setminus \{u, v\}\). Then \(B\) is \(f\)-choosable.

Assume that \(G = (V, E)\) is an undirected and connected graph, and consider \(C \subseteq V\). For every \(v \in V\), let \(I_r(v) = \{u \in C: d(u,v) \leq r\}\), where \(d(u,v)\) denotes the number of edges on any shortest path between \(u\) to \(v\) in \(G\). If all the sets \(I_r(v)\) for \(v \in V\) are pairwise different, and none of them is the empty set, \(C\) is called an \(r\)-identifying code. In this paper, we consider \(t\)-vertex-robust \(r\)-identifying codes of level \(s\), that is, \(r\)-identifying codes such that they cover every vertex at least \(s\) times and the code is vertex-robust in the sense that \(|I_r(u) \Delta I_r(v)| \geq 2t+1\) for any two different vertices \(u\) and \(v\). Vertex-robust identifying codes of different levels are examined, in particular, of level \(3\). We give bounds (sometimes exact values) on the density or cardinality of the codes in binary hypercubes and in some infinite grids.

A clique \(C\) is an extreme clique of an interval graph \(G\) if there exists some interval model of \(G\) in which \(C\) is the first clique. A graph \(G\) is homogeneously clique-representable if all cliques of \(G\) are extreme cliques. In this paper, we present characterizations of extreme cliques and homogeneously clique-representable graphs.

In this note, we show that there is no \((945, 177, 33)\)-difference set in any group \(G\) of order \(945\) with a normal subgroup \(K\) such that \(G/K \cong \mathbb{C}_{27} \times \mathbb{C}_5\), and hence no cyclic difference set with such parameters exists. This fills one entry of Baumert and Gordon’s table with “No”.