Maximal core size in singular graphs

DOI10.26493/1855-3974.115.891zbMath1190.05084OpenAlexW1958170854WikidataQ129363626 ScholiaQ129363626MaRDI QIDQ3552334

Irene Sciriha

Publication date: 15 April 2010

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

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

zbMATH Keywords

adjacency matrixnullitysingular configurationscore widthextremal singular graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

On 12-regular nut graphs ⋮ On singular signed graphs with nullspace spanned by a full vector: signed nut graphs ⋮ On the spectrum of threshold graphs ⋮ On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices ⋮ The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace ⋮ Coalescing Fiedler and core vertices

This page was built for publication: Maximal core size in singular graphs