On nested split graphs whose second largest eigenvalue is less than 1

DOI10.1016/J.LAA.2008.11.026zbMATH Open1194.05098OpenAlexW2038233950MaRDI QIDQ1014485FDOQ1014485

Authors: Zoran Stanić 

Publication date: 29 April 2009

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

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

Recommendations

• The nested split graphs whose second largest eigenvalue is equal to 1
• Nested graphs with bounded second (signless Laplacian) eigenvalue
• Some notes on the threshold graphs
• Some notes on graphs whose second largest eigenvalue is less than (√5−1)/2
• On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)

zbMATH Keywords

adjacency matrixsecond largest eigenvaluenested split graphsdivisor technique

Mathematics Subject Classification ID

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

Cites Work

• Eigenspaces of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some notes on spectra of cographs.
• A Linear Recognition Algorithm for Cographs
• The rank of a cograph
• Title not available (Why is that?)
• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• On graphs with unicyclic star complement for 1 as the second largest eigenvalue
• On graphs whose second largest eigenvalue equals 1 -- the star complement technique
• On unicyclic graphs whose second largest eigenvalue does not exceed 1
• On bicyclic graphs whose second largest eigenvalue does not exceed 1
• Title not available (Why is that?)

Cited In (25)

• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
• A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph
• On the spectrum of threshold graphs
• Some notes on the threshold graphs
• An explicit formula for the distance characteristic polynomial of threshold graphs
• Eigenvalue location in graphs of small clique-width
• No threshold graphs are cospectral
• Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1
• Nested graphs with bounded second (signless Laplacian) eigenvalue
• 2-nested matrices: towards understanding the structure of circle graphs
• Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
• Fast algorithms for indices of nested split graphs approximating real complex networks
• On tricyclic graphs whose second largest eigenvalue does not exceed 1
• The \(A_\alpha\)-spectral radius of complements of bicyclic and tricyclic graphs with \(n\) vertices
• On graphs whose second largest eigenvalue is at most 1
• Graphs with least eigenvalue \(-2\): ten years on
• The A_α-spectral radius of dense graphs
• Planar graphs whose second largest eigenvalue smaller than \(\frac{\sqrt{5}-1}{2}\)
• Eigenvalue location in threshold graphs
• Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
• Efficient computation of the characteristic polynomial of a threshold graph
• The \(T_{1,2}\)-free planar 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
• The nested split graphs whose second largest eigenvalue is equal to 1

This page was built for publication: On nested split graphs whose second largest eigenvalue is less than 1

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