Characterization of sub-long graphs of arbitrary rank
From MaRDI portal
Recommendations
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A characterization of long graphs of arbitrary rank
- A characterization of singular graphs
- On nut and core singular fullerenes
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- 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 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 tricyclic graphs
- On the nullity of unicyclic graphs
- Spektren endlicher Grafen
Cited in
(4)- A characterization of long graphs of arbitrary rank
- Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph
- Characterizations of graphs with given inertia index achieving the maximum diameter
- A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
This page was built for publication: Characterization of sub-long graphs of arbitrary rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975119)
