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

DOI10.1016/j.laa.2006.08.025zbMath1106.05067OpenAlexW1977427413MaRDI QIDQ861035

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)

Related Items (15)

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 ⋮ Regular and maximal graphs with prescribed tripartite 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 ⋮ Unnamed Item ⋮ Unions of a clique and a co-clique as star complements for non-main graph eigenvalues ⋮ The main vertices of a star set and related graph parameters ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On regular graphs and coronas whose second largest eigenvalue does not exceed 1 ⋮ On graphs with prescribed star complements ⋮ On nested split graphs whose second largest eigenvalue is less than 1

Cites Work

• On graphs whose star complement for \(-2\) is a path or a cycle
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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