Spectral radii of friendship graphs and their connected induced subgraphs
From MaRDI portal
Publication:6102230
DOI10.1080/03081087.2021.2017836zbMath1512.05282OpenAlexW4200208202MaRDI QIDQ6102230
Publication date: 8 May 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2021.2017836
spectral radiuscospectralityfriendship graphsseparability indexcomplementarity eigenvaluespectral redundancy
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Connectivity (05C40)
Related Items (2)
The eccentricity spread of weak-friendship graphs ⋮ Graphs sharing an arbitrary number of ordered complementarity eigenvalues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spectral characterization of butterfly-like graphs
- On the two largest \(Q\)-eigenvalues of graphs
- Spektren endlicher Grafen
- Infinite generalized friendship graphs
- Some graphs determined by their spectra
- Graphic sequences with a realization containing a generalized friendship graph
- tK\(_p\)-saturated graphs of minimum size
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Complementarity eigenvalue analysis of connected graphs
- Graphs with a small number of distinct induced subgraphs
- Repetition of spectral radiuses among connected induced subgraphs
- On cardinality of complementarity spectra of connected graphs
- Determining graphs by the complementary spectrum
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- The graphs cospectral with the pineapple graph
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- Complementary eigenvalues of graphs
- A sum labelling for the generalised friendship graph
- The characteristic polynomial of a graph
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues
- Connected graphs cospectral with a friendship graph
- Laplacian spectral determination of path-friendship graphs
- THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS
- On the index of cactuses with n vertices
- Cospectral Graphs and Digraphs
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
This page was built for publication: Spectral radii of friendship graphs and their connected induced subgraphs