On regular graphs with a tree of diameter 3 as a star complement

DOI10.1016/J.DISC.2025.114488MaRDI QIDQ6979280zbMATH OpenFDO

Authors P. Rowlinson, Zoran Stanić

Publication date 26 May 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114488

zbMATH Keywords

adjacency matrixdouble stareigenvaluestar set

Mathematics Subject Classification ID

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

Cites work

• A sharp upper bound of the spectral radius of graphs
• An extension of the star complement technique for regular graphs
• An introduction to the theory of graph spectra
• Inequalities for Graph Eigenvalues
• On trees as star complements in regular graphs
• Regular graphs with a cycle as a star complement
• Regular graphs with a prescribed complete multipartite graph as a star complement
• Regular graphs. A spectral approach
• Relations between ( , )-regular sets and star complements.
• Star complements in regular graphs: old and new results
• Strong star complements in graphs

This page was built for publication: On regular graphs with a tree of diameter 3 as a star complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979280)