A characterization of signed planar graphs with rank at most 4
From MaRDI portal
Publication:2805665
DOI10.1080/03081087.2015.1057137zbMath1335.05079OpenAlexW1588965795MaRDI QIDQ2805665
No author found.
Publication date: 12 May 2016
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2015.1057137
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Related Items (13)
Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ The rank of a signed graph ⋮ Complex unit gain graphs of rank 2 ⋮ Upper bound of skew energy of an oriented graph in terms of its skew rank ⋮ Bounds for the matching number and cyclomatic number of a signed graph in terms of rank ⋮ Signed graphs with cut points whose positive inertia indexes are two ⋮ On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs ⋮ The signed graphs with all but at most three eigenvalues equal to \(-1\) ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph ⋮ Nullity of a graph in terms of path cover number ⋮ Relation between the rank of a signed graph and the rank of its underlying graph ⋮ The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
Cites Work
- A characterization of graphs with rank 5
- A characterization of graphs with rank 4
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- On the nullity of graphs with pendent vertices
- The minimum rank of symmetric matrices described by a graph: a survey
- Signed graphs
- Largest eigenvalue of a unicyclic mixed graphs
- A note on the nullity of unicyclic signed graphs
- On the nullity of unicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of graphs with pendant trees
This page was built for publication: A characterization of signed planar graphs with rank at most 4
