Graphs cospectral with a friendship graph or its complement

zbMath1302.05083arXiv1307.5411MaRDI QIDQ2933527

Alireza Abdollahi, Mohammad Reza Oboudi, Shahrooz Janbaz

Publication date: 3 December 2014

Full work available at URL: https://arxiv.org/abs/1307.5411

zbMATH Keywords

cospectral graphsadjacency eigenvaluesfriendship graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (14)

The graphs with all but two eigenvalues equal to \(-2\) or 0 ⋮ WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS ⋮ Principal eigenvector localization and centrality in networks: revisited ⋮ On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs ⋮ When local and global clustering of networks diverge ⋮ Doubling constants and spectral theory on graphs ⋮ Core-satellite graphs: clustering, assortativity and spectral properties ⋮ On the spectral determinations of the connected multicone graphs ⋮ A large family of cospectral Cayley graphs over dihedral groups ⋮ The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) ⋮ Connected graphs cospectral with a friendship graph ⋮ Groups all of whose undirected Cayley graphs are determined by their spectra ⋮ Constructing Clifford algebras for windmill and Dutch windmill graphs; a new proof of the friendship theorem ⋮ The graphs with all but two eigenvalues equal to \(\pm 1\)

This page was built for publication: Graphs cospectral with a friendship graph or its complement