Proof of conjectures on adjacency eigenvalues of graphs

DOI10.1016/j.disc.2012.09.017zbMath1254.05099OpenAlexW2013509986WikidataQ123094755 ScholiaQ123094755MaRDI QIDQ1759806

Kinkar Chandra Das

Publication date: 22 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.09.017

zbMATH Keywords

diameteradjacency matrixgirthdeterminantaverage eccentricityfriendship graphadjacency eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Related Items

Monster graphs are determined by their Laplacian spectra, Complete split graph determined by its (signless) Laplacian spectrum, WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS, The spectral characterization of wind-wheel graphs, On the spectral radius of bipartite graphs which are nearly complete, On minimally 2-(edge)-connected graphs with extremal spectral radius, When local and global clustering of networks diverge, Proof of conjectures involving algebraic connectivity of graphs, Comparison between Szeged indices of graphs, Proof of conjectures on remoteness and proximity in graphs, Kite graphs determined by their spectra, Core-satellite graphs: clustering, assortativity and spectral properties, Combinatorial and spectral properties of König-Egerváry graphs, The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\), Laplacian spectral determination of path-friendship graphs, Connected graphs cospectral with a friendship graph, The graphs with all but two eigenvalues equal to \(\pm 1\), The difference between remoteness and radius of a graph