On the nullity number of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5642062 (Why is no real title available?)
- scientific article; zbMATH DE number 3783047 (Why is no real title available?)
- scientific article; zbMATH DE number 1248194 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 1123800 (Why is no real title available?)
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3222645 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- A note on graphs with zero nullity
- Describing the nonsingular unicyclic graph
- Maximum induced trees in graphs
- More about singular line graphs of trees
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of graphs with pendant trees
- On the nullity of graphs with pendent vertices
- On the nullity of line graphs of trees
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Spektren endlicher Grafen
- Symmetric Matrices and Quadratic Forms
- The rank of a graph after vertex addition
- Trees with maximum nullity
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
Cited in
(18)- Nullity of graphs -- a survey and some new results
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- 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 and the matching number of unicyclic graphs
- On the nullity of bipartite graphs
- On the singularity of graphs: zero forcing parameters
- 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 its domination number.
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Graphentheoretische Ermittlung der Anzahl von strukturellen und streng strukturellen Invarianten Nullstellen / Graph-theoretical determination of the number of structural and strictly structural invariant zeros
- The multiplicities of eigenvalues of a graph
- Characterizing Graphs with Nullity n-4
- On the nullity of graphs
- An improved lower bound for the nullity of a graph in terms of matching number
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)
