Sets of cospectral graphs with least eigenvalue at least -2 and some related results | Zendy

Dragoš Cvetković | Zendy; Mirko Lepović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Sets of cospectral graphs with least eigenvalue at least -2 and some related results

Author(s) -

Dragoš Cvetković,

Mirko Lepović

Publication year - 2004

Publication title -

bulletin classe des sciences mathematiques et natturalles

Language(s) - English

Resource type - Journals

eISSN - 2406-0909

pISSN - 0561-7332

DOI - 10.2298/bmat0429085c

Subject(s) - combinatorics , mathematics , eigenvalues and eigenvectors , multiplicity (mathematics) , line graph , indifference graph , pathwidth , graph , discrete mathematics , physics , mathematical analysis , quantum mechanics

In this paper we study the phenomenon of cospectrality in generalized line graphs and in exceptional graphs. The paper contains a table of sets of Co spectral graphs with least eigenvalue at least —2 and at most 8 vertices together with some comments and theoretical explanations of the phenomena suggested by the table. In particular, we prove that the multiplicity of the number 0 in the spectrum of a generalized line graph L(G) is at least the number of petals of the corresponding root graph G. .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research