Maximal core size in singular graphs
DOI10.26493/1855-3974.115.891zbMATH Open1190.05084OpenAlexW1958170854WikidataQ129363626 ScholiaQ129363626MaRDI QIDQ3552334FDOQ3552334
Authors: 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
Recommendations
- Maximal and extremal singular graphs
- scientific article; zbMATH DE number 7692340
- Publication:4505809
- Extremal singular graphs
- Singularity of the \(k\)-core of a random graph
- Maximal graphs and graphs with maximal spectral radius
- Maximum size of maximally irregular graphs
- Maximum sizes of graphs with given domination parameters
- The size of strength‐maximal graphs
- The maximum size of graphs satisfying a degree condition
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cited In (13)
- Extremal singular graphs
- Extremal non-bonding orbitals
- Coalescing Fiedler and core vertices.
- On 12-regular 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
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
- On nut and core singular fullerenes
- Minimal configuration unicyclic graphs
- A note proving the nullity of block graphs is unbounded
- Maximal and extremal singular graphs
- Minimal configuration trees
- The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace
This page was built for publication: Maximal core size in singular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552334)
