Characterization of sub-long graphs of arbitrary rank

DOI10.1080/03081087.2016.1242128zbMath1368.05026OpenAlexW2535057065MaRDI QIDQ4975119

Xiaobin Ma, Long Wang

Publication date: 3 August 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2016.1242128

zbMATH Keywords

nullity of graphsrank of graphssub-long graphs

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Characterizations of graphs with given inertia index achieving the maximum diameter ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph

Cites Work

• A characterization of graphs with rank 5
• 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
• On the nullity of bicyclic graphs
• On the nullity of graphs with pendent vertices
• On the construction of graphs of nullity one
• A characterization of long graphs of arbitrary rank
• On the null-spaces of acyclic and unicyclic singular graphs
• On nut and core singular fullerenes
• On the nullity of unicyclic graphs
• On the nullity of graphs
• A characterization of singular 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 graphs with pendant trees

This page was built for publication: Characterization of sub-long graphs of arbitrary rank