|
Two kinds of bicyclic graphs are determined by their Laplacian spectra
WANG Zhan-qing, WANG Li-gong, MEI Ruo-xing, ZHAI Ruo-nan, DONG Zhan-peng
Applied Mathematics A Journal of Chinese Universities, 2016, 31(1): 73-82.
Let $G=(V(G), E(G))$ be a simple connected graph with vertex $V(G)$ and edge set $E(G)$. Two graphs are said to be Laplacian cospectral if they have the same Laplacian spectrum. In this paper, two kinds of bicyclic graphs $Q(n; n_{1}, n_2, \cdots , n_t)$ and $B(n; n_{1}, n_{2})$ are defined. It is proved that graphs $Q(n; n_{1})$, $Q(n; n_{1}, n_{2})$, $Q(n; n_{1}, n_{2}, n_{3})$, and $B(n; n_{1}, n_{2})$ are determined by their Laplacian spectra.
|
14 articles
|