A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
From MaRDI portal
Publication:6152840
DOI10.2478/AUSM-2023-0019OpenAlexW4390233571MaRDI QIDQ6152840FDOQ6152840
Mert Sinan Oz, Ismail Naci Cangül
Publication date: 13 February 2024
Published in: Acta Universitatis Sapientiae. Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausm-2023-0019
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07)
Cites Work
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A characterization of graphs with rank 5
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- On the nullity and the matching number of unicyclic graphs
- A remark on the existence of finite graphs
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the nullity number of graphs
- Nullity of graphs: an updated survey
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- The extremal graphs with respect to their nullity
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- Title not available (Why is that?)
This page was built for publication: A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152840)