On the nullity number of graphs
From MaRDI portal
Publication:5006628
DOI10.5614/EJGTA.2017.5.2.14zbMATH Open1467.05134OpenAlexW2766975978MaRDI QIDQ5006628
Pierre Hansen, Mustapha Aouchiche
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.2.14
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with maximum nullity
- On the nullity of unicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- Spektren endlicher Grafen
- On the nullity of bicyclic graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Maximum induced trees in graphs
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- The rank of a graph after vertex addition
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity of graphs
- More about singular line graphs of trees
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Symmetric Matrices and Quadratic Forms
Cited In (13)
- The extremal graphs with respect to their nullity
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- On the nullity of bipartite graphs
- On the nullity and the matching number of unicyclic graphs
- The characterization of the minimal weighted acyclic graphs
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- Nullity of a graph in terms of path cover number
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros
- Characterizing Graphs with Nullity n-4
- The multiplicities of eigenvalues of a graph
Uses Software
This page was built for publication: On the nullity number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006628)
