Characterization of graphs whose signature equals the number of odd cycles
From MaRDI portal
(Redirected from Publication:331171)
Recommendations
Cites work
- scientific article; zbMATH DE number 6100973 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- Bicyclic graphs with small positive index of inertia
- On the characterization of graphs with pendent vertices and given nullity
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- On the nullity of the line graph of unicyclic graph with depth one
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Positive and negative inertia index of a graph
- Spektren endlicher Grafen
- The inertia of unicyclic graphs and the implications for closed-shells
- The nullity of \((k-1)\)-cyclic graphs
- The nullity of \(k\)-cyclic graphs of \(\infty\)-type
- The rank of a graph after vertex addition
- The signature of \(k\)-cyclic graphs of \(\infty\)-type
- The signature of line graphs and power trees
- Trees with maximum nullity
Cited in
(5)- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- Nullity of a graph in terms of path cover number
- The signature of \(k\)-cyclic graphs of \(\infty\)-type
- On the relation between the positive inertia index and negative inertia index of weighted graphs
- An improved lower bound for the nullity of a graph in terms of matching number
This page was built for publication: Characterization of graphs whose signature equals the number of odd cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331171)