Spectral characterization of families of split graphs

DOI10.1007/S00373-013-1387-8zbMATH Open1309.05114OpenAlexW2000785719MaRDI QIDQ489341FDOQ489341

D. M. Cardoso, Milica Andelić

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

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

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)

Cites Work

• Title not available (Why is that?)
• Maximum \(k\)-regular induced subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite
• 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)