Characterization of graphs whose signature equals the number of odd cycles
From MaRDI portal
Publication:331171
DOI10.1016/j.laa.2016.09.017zbMath1347.05117OpenAlexW2519796174WikidataQ114152361 ScholiaQ114152361MaRDI QIDQ331171
Dein Wong, Xiaobin Ma, Fenglei Tian
Publication date: 26 October 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.09.017
Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (3)
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 ⋮ Nullity of a graph in terms of path cover number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of graphs with rank 5
- On the nullity of the line graph of unicyclic graph with depth one
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- The inertia of unicyclic graphs and the implications for closed-shells
- On the nullity of bicyclic graphs
- The rank of a graph after vertex addition
- Trees with maximum nullity
- Positive and negative inertia index of a graph
- Bicyclic graphs with small positive index of inertia
- The nullity of \((k-1)\)-cyclic graphs
- The signature of line graphs and power trees
- On the nullity of unicyclic graphs
- The signature ofk-cyclic graphs of ∞-type
- The nullity ofk-cyclic graphs of ∞-type
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
This page was built for publication: Characterization of graphs whose signature equals the number of odd cycles