Spectral characterization of multicone graphs
- 25 March 2012
- journal article
- research article
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 62 (1) , 117-126
Abstract
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho’s result [B. Zhou, H.H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph. Additionally, lower and upper bounds for the largest eigenvalue of a multicone graph are given.Keywords
This publication has 12 references indexed in Scilit:
- Developments on spectral characterizations of graphsDiscrete Mathematics, 2009
- Enumeration of cospectral graphsEuropean Journal of Combinatorics, 2004
- Which graphs are determined by their spectrum?Linear Algebra and its Applications, 2003
- Some Inequalities for the Largest Eigenvalue of a GraphCombinatorics, Probability and Computing, 2002
- A Sharp Upper Bound of the Spectral Radius of GraphsJournal of Combinatorial Theory, Series B, 2001
- Constructing cospectral graphsAequationes mathematicae, 1982
- Generalized line graphsJournal of Graph Theory, 1981
- A note on cospectral graphsJournal of Combinatorial Theory, Series B, 1980
- Cospectral Graphs and DigraphsBulletin of the London Mathematical Society, 1971
- Zusammenhang von Graphentheorie und MO‐Theorie von Molekeln mit Systemen konjugierter BindungenHelvetica Chimica Acta, 1956