On graphs whose second largest eigenvalue equals 1 -- the star complement technique

DOI10.1016/J.LAA.2006.08.025MaRDI QIDQ861035zbMATH OpenOpenAlexFDO

Authors Zoran Stanić

Publication date 9 January 2007

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2006.08.025

zbMATH Keywords

adjacency matrix

Mathematics Subject Classification ID

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

Recommendations

• Some star complements for the second largest eigenvalue of a graph
• On graphs with unicyclic star complement for 1 as the second largest eigenvalue
• Graphs with prescribed star complement for 1 as the second largest eigenvalue.
• An extension of the star complement technique for regular graphs
• On graphs with prescribed star complements

Cites work

• Eigenspaces of graphs
• scientific article; zbMATH DE number 540115 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1522764 (Why is no real title available?)
• scientific article; zbMATH DE number 2149405 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• On graphs whose star complement for \(-2\) is a path or a cycle
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES

Cited in

(23)

• On nested split graphs whose second largest eigenvalue is less than 1
• On graphs with prescribed star complements
• Maximal graphs with a prescribed complete bipartite graph as a star complement
• On joins of a clique and a co-clique as star complements in regular graphs
• The main vertices of a star set and related graph parameters
• Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
• Graphs with prescribed star complement for 1 as the second largest eigenvalue.
• Some star complements for the second largest eigenvalue of a graph
• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• Graphs with least eigenvalue -2: ten years on
• Unions of a clique and a co-clique as star complements for non-main graph eigenvalues
• On graphs with unicyclic star complement for 1 as the second largest eigenvalue
• Regular and maximal graphs with prescribed tripartite graph as a star complement
• Regular graphs with a complete bipartite graph as a star complement
• Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
• Strong star complements in graphs
• Spectral characterization of the complete graph removing a cycle
• On tricyclic graphs whose second largest eigenvalue does not exceed 1
• The complete classification of graphs whose second largest eigenvalue of the eccentricity matrix is less than 1
• Employing star complements in search for graphs with fixed rank
• Connected triangle-free planar graphs whose second largest eigenvalue is at most 1
• On K₄-minor free graphs whose second largest eigenvalue does not exceed 1
• Star complements in Hermitian matrices

This page was built for publication: On graphs whose second largest eigenvalue equals 1 -- the star complement technique

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