A characterization of signed planar graphs with rank at most 4

DOI10.1080/03081087.2015.1057137MaRDI QIDQ2805665zbMATHOpenAlexFDO

Authors Fenglei Tian, Dengyin Wang, Min Zhu

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

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)

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

Cites work

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

Cited in

(21)

• Upper bound of skew energy of an oriented graph in terms of its skew rank
• Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
• On connected signed graphs with rank equal to girth
• The rank of a signed graph
• The relative signed clique number of planar graphs is 8
• A note on complex-4-colorability of signed planar graphs
• On the rank of weighted graphs
• Signed graphs with cut points whose positive inertia indexes are two
• Complex unit gain graphs of rank 2
• 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 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
• The rank of a signed graph in terms of the rank of its underlying graph
• A characterization of graphs with rank 4
• Characterizations of signed graphs with small ranks
• Some criteria for a signed graph to have full rank
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank

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)