Let $G$ be a graph with $n$ vertices, $\mathcal{G}(G)$ the subdivision graph of $G$. $V(G)$ denotes the set of original vertices of $G$. The generalized subdivision corona vertex graph of $G$ and $H_1,H_2,\dots ,H_n$ is the graph obtained from $\mathcal{G}(G)$ and $H_1,H_2,\dots ,H_n$ by joining the $i$th vertex of $V(G)$ to every vertex of $H_i$. In this paper, we determine the Laplacian (respectively, the signless Laplacian) characteristic polynomial of the generalized subdivision corona vertex graph. As an application, we construct infinitely many pairs of cospectral graphs.

In the paper, we show that the orientable genus of the generalized Petersen graph $P(km,m)$ is at least $\frac{km}{4}–\frac{m}{2}-\frac{km}{4m-4}+1$ if $m\ge 4$ and $k\ge 3$. We determine the orientable genera of $P(3m,m)$, $P(4k,4)$, $P(4m,m)$ if $m\ge 4$, $P(6m,m)$ if $m\equiv 0(\mathrm{mod}2)$ and $m\ge 6$, and so on.

Assume that ${\mu }_1,{\mu }_2,\dots ,{\mu }_n$ are the eigenvalues of the Laplacian matrix of a graph $G$. The Laplacian Estrada index of $G$, denoted by $LEE(G)$, is defined as $LEE(G)=\sum _{i=1}^n{e}^{{\mu }_i}$. In this note, we give an upper bound on $LEE(G)$ in terms of chromatic number and characterize the corresponding extremal graph.

In this note, we provide a combinatorial proof of a recent formula for the total number of peaks and valleys (either strict or weak) within the set of all compositions of a positive integer into a fixed number of parts.

The adjacent vertex distinguishing total chromatic number ${\chi }_{at}(G)$ of a graph $G$ is the smallest integer $k$ for which $G$ admits a proper $k$-total coloring such that no pair of adjacent vertices are incident to the same set of colors. Snarks are connected bridgeless cubic graphs with chromatic index $4$. In this paper, we show that ${\chi }_{at}(G)=5$ for two infinite subfamilies of snarks, i.e., the Loupekhine snark and Blanusa snark of first and second kind. In addition, we give an adjacent vertex distinguishing total coloring using $5$ colors for Watkins snark and Szekeres snark, respectively.

Let $G$ be a tricyclic graph. Tricyclic graphs are connected graphs in which the number of edges equals the number of vertices plus two. In this paper, we determine graphs with the largest signless Laplacian spectral radius among all the tricyclic graphs with $n$ vertices and diameter $d$.

A pebbling move on a graph $G$ consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number of a graph $G$, denoted by $f(G)$, is the least integer $n$ such that, however $n$ pebbles are located on the vertices of $G$, we can move one pebble to any vertex by a sequence of pebbling moves. For any connected graphs $G$ and $H$, Graham conjectured that $f(G\times H)\le f(G)f(H)$. In this paper, we give the pebbling number of some graphs and prove that Graham’s conjecture holds for the middle graphs of some even cycles.

Graph embedding is an important factor to evaluate the quality of an interconnection network. It is also a powerful tool for implementation of parallel algorithms and simulation of different interconnection networks. In this paper, we compute the exact wirelength of embedding circulant networks into cycle-of-ladders.

In this paper, we characterize the extremal digraph with the maximal signless Laplacian spectral radius and the minimal distance signless Laplacian spectral radius among all simple connected digraphs with a given dichromatic number, respectively.

Given a graph $G=(V,E)$ with no isolated vertex, a subset $S\subseteq V$ is a total dominating set of $G$ if every vertex in $V$ is adjacent to a vertex in $S$. A total dominating set $S$ of $G$ is a locating-total dominating set if for every pair of distinct vertices $u$ and $v$ in $V–S$, we have $N(u)\cap S\ne N(v)\cap S$, and $S$ is a differentiating-total dominating set if for every pair of distinct vertices $u$ and $v$ in $V$, we have $N(u)\cap S\ne N(v)\cap S$. The locating-total domination number (or the differentiating-total domination number) of $G$, denoted by ${\gamma }_t^L(G)$ (or ${\gamma }_t^D(G)$), is the minimum cardinality of a locating-total dominating set (or a differentiating-total dominating set) of $G$. In this paper, we investigate the bounds of locating and differentiating-total domination numbers of unicyclic graphs.