Spectral characterization of families of split graphs

DOI10.1007/s00373-013-1387-8zbMath1309.05114OpenAlexW2000785719MaRDI QIDQ489341

Milica Anđelić, Domingos Moreira 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

split graphlargest eigenvalueprincipal eigenvectorprogramming involving graphs

Mathematics Subject Classification ID

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

Cites Work

• Spectral upper bounds for the order of a \(k\)-regular induced subgraph
• Maximum \(k\)-regular induced subgraphs
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• Unnamed Item
• Unnamed Item
• Unnamed Item

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