A characterization of signed planar graphs with rank at most 4

DOI10.1080/03081087.2015.1057137zbMATH Open1335.05079OpenAlexW1588965795MaRDI QIDQ2805665FDOQ2805665

Min Zhu, Fenglei Tian, Dengyin Wang

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

Recommendations

• Relation between the rank of a signed graph and the rank of its underlying graph
• The rank of a signed graph
• Adjacency rank and independence number of a signed graph
• Characterizations of signed graphs with small ranks
• The rank of a signed graph in terms of the rank of its underlying graph

zbMATH Keywords

rankadjacency matrixsigned planar graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)

Cites Work

• Signed graphs
• On the nullity of unicyclic graphs
• A characterization of graphs with rank 5
• On the nullity of bipartite graphs
• A characterization of graphs with rank 4
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• On the nullity of graphs with pendant trees
• On the nullity of graphs with pendent vertices
• Largest eigenvalue of a unicyclic mixed graphs
• A note on the nullity of unicyclic signed graphs

Cited In (16)

• The relative signed clique number of planar graphs is 8
• A note on complex-4-colorability of signed planar graphs
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• The signed graphs with all but at most three eigenvalues equal to \(-1\)
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• A characterization of graphs with rank 4
• The rank of a signed graph
• Complex unit gain graphs of rank 2
• Nullity of a graph in terms of path cover number
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Upper bound of skew energy of an oriented graph in terms of its skew rank
• Signed graphs with cut points whose positive inertia indexes are two
• Relation between the rank of a signed graph and the rank of its underlying graph
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• An improved lower bound for the nullity of a graph in terms of matching number
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs

This page was built for publication: A characterization of signed planar graphs with rank at most 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805665)