Spectral characterization of families of split graphs

DOI10.1007/S00373-013-1387-8MaRDI QIDQ489341zbMATH OpenOpenAlexFDO

Authors Milica Andelić, D. M. Cardoso

Publication date 20 January 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-013-1387-8

zbMATH Keywords

largest eigenvaluesplit graphprincipal eigenvectorprogramming involving graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Structural characterization of families of graphs (05C75)

Recommendations

• On the spectral characterizations of graphs
• Spectral characterizations of two families of nearly complete bipartite graphs
• Splitting fields of spectra of circulant graphs
• Generalized spectral characterization of graphs revisited
• On the spectral characterization of \(G\)-graph
• Spectral characterizations of almost complete graphs
• A survey on spectral characterizations of graphs
• Spectral bisection of graphs and connectedness
• On generalized split graphs
• Spectral properties of some structurally related graphs

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3451876 (Why is no real title available?)
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• An introduction to the theory of graph spectra
• Maximum \(k\)-regular induced subgraphs
• Spectral upper bounds for the order of a \(k\)-regular induced subgraph

Cited in

(1)

• Characterization of split graphs with at most four distinct eigenvalues

This page was built for publication: Spectral characterization of families of split graphs

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