Deza and Grishukhin studied \(3\)-valent maps \(M_n{(p,q)}\) consisting of a ring of \(n\) \(g\)-gons whose inner and outer domains are filled by \(p\)-gons. They described the conditions for \(n, p, q\) under which such a map may exist and presented several infinite families of them. We extend their results by presenting several new maps concerning mainly large values of \(n\) and \(q\).

A simple, undirected \(2\)-connected graph \(G\) of order \(n\) belongs to the class \(\mathcal{B}(n,\theta)\), \(\theta \geq 0\) if \(2(d(x) + d(y) + d(z)) \geq 3(n – 1 – \theta)\) holds for all independent triples \(\{x,y,z\}\) of vertices. It is known (Bondy’s theorem for \(2\)-connected graphs) that \(G\) is hamiltonian if \(\theta = 0\). In this paper we give a full characterization of graphs \(G\) in \(\mathcal{B}(n,\theta)\), \(\theta \leq 2\) in terms of their dual hamiltonian closure.

Two classes of regular Cayley maps, balanced and antibalanced, have long been understood, see \([12,11]\). A recent generalization is that of an e-balanced map, see \([7,2,5,8]\). These maps can be described using the power function introduced in \([4]\); e-balanced maps are the ones with constant power functions on the generating set. In this paper we examine a further generalization to the situation where the power function alternates between two values.

In this paper, we obtain the spectral norm and eigenvalues of circulant matrices with Horadam’s numbers. Furthermore, we define the semicirculant matrix with these numbers and give the Euclidean norm of this matrix.

We denote by \(G(n)\) the graph obtained by removing a Hamilton cycle from the complete graph \(K_n\). In this paper, we calculate the lower bound for the minimum number of monochromatic triangles in any \(2\)-edge coloring of \(G(n)\) using the weight method. Also, by explicit constructions, we give an upper bound for the minimum number of monochromatic triangles in \(2\)-edge coloring of \(G(n)\) and the difference between our lower and upper bound is just two.

In this paper, it is proved that the \(h\)-chromatic uniqueness of the linear \(h\)-hypergraph consisting of two cycles of lengths \(p\) and \(q\) having \(r\) edges in common when \(p=q\), \(2 \leq r \leq p-2\), and \(h \geq 3\). We also obtain the chromatic polynomial of a connected unicyclic linear \(h\)-hypergraph and show that every \(h\)-uniform cycle of length three is not chromatically unique for \(h \geq 3\).

The projection of binary linear block codes of length \(4m\) on \(\mathbb{F}_4^m\) is considered. Three types of projections, namely projections \(SE\), \(E\), and \(O\) are introduced. The BCH codes, Golay codes, Reed-Muller codes, and the quadratic residue code \(q_{32}\) are examined.

The hyper Wiener index of a connected graph \(G\) is defined as
\(WW(G) = \frac{1}{2}\sum_{u,v \in V(G)} d(u,v) + \frac{1}{2}\sum_{(u,v) \in V(G)} d(u,v)^2\) where \(d(u, v)\) is the distance between vertices \(u,v \in V(G)\).
In this paper we find an exact expression for hyper Wiener index of \(HC_6[p, q]\), the zigzag polyhex nanotori.

In this paper, we classify all optimal linear \([n, n/2]\) codes over \(\mathbb{Z}_4\) up to length \(n = 8\), and determine the number of optimal codes which are self-dual and formally self-dual. Optimal codes with linear binary images are identified. In particular, we show that for length \(8\), there are nine optimal codes for the Hamming distance, one optimal code for the Lee distance, and two optimal codes for the Euclidean distance.

In this paper, we show that if \(k \geq \frac{v+2}{4}\), where \(v\) denotes the order of a graph, a non-bipartite graph \(G\) is \(k\)-extendable if and only if it is \(2k\)-factor-critical. If \(k \geq \frac{v-3}{4}\), a graph \(G\) is \(k\)-extendable if and only if it is \((2k+1)\)-factor-critical. We also give examples to show that the two bounds are best possible. Our results are answers to a problem posted by Favaron \([3]\) and Yu \([11]\).