Some star complements for the second largest eigenvalue of a graph

DOI10.26493/1855-3974.11.D83MaRDI QIDQ3535848zbMATH OpenOpenAlexWikidataFDO

Authors Zoran Stanić

Publication date 14 November 2008

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.11.d83

zbMATH Keywords

adjacency matrixdivisor conceptgraph eigenvaluesmathematical softwarestar complement

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• On graphs whose second largest eigenvalue equals 1 -- the star complement technique
• Graphs with prescribed star complement for 1 as the second largest eigenvalue.
• On graphs with unicyclic star complement for 1 as the second largest eigenvalue
• On graphs with prescribed star complements
• scientific article; zbMATH DE number 1877029

Cited in

(6)

• SCL
• Graphs with least eigenvalue -2: ten years on
• Unions of a clique and a co-clique as star complements for non-main graph eigenvalues
• Strong star complements in graphs
• Employing star complements in search for graphs with fixed rank
• On graphs whose second largest eigenvalue equals 1 -- the star complement technique

This page was built for publication: Some star complements for the second largest eigenvalue of a graph

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