Operations Research Transactions

Previous Articles     Next Articles

Laplacian spectral characterizations of some classes of multi-cyclic graphs

ZHAI Ruonan1 WANG Ligong1,* DONG Zhanpeng1  WANG Zhanqing1 MEI Ruoxing1   

  1. 1. Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi'an 710072, China
  • Received:2015-08-06 Online:2016-06-15 Published:2016-06-15

Abstract:

Let G be a simple connected graph. A graph G is called to be determined by its Laplacian spectrum if any graph having the same Laplacian spectrum as G is isomorphic to G. In this paper, a bicyclic graph \theta_{n}(p_1,p_2,\cdots,p_t) and a m-cyclic graph H_n(m\cdot C_3;p_1,p_2,\cdots,p_t) are defined. It is proved that bicyclic graphs \theta_{n}(p), \theta_{n}(p,q), and tricyclic graphs H_n(3\cdot C_3;p),  H_n(3\cdot C_3;p,q) are determined by their Laplacian spectra.

Key words: Laplacian spectrum, degree sequence, bicyclic graph, tricyclic graph graph