The rank of a signed graph

DOI10.1016/J.LAA.2022.06.024MaRDI QIDQ2158295zbMATH OpenOpenAlexWikidataFDO

Authors Qian-Qian Chen, Jiming Guo

Publication date 26 July 2022

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2022.06.024

zbMATH Keywords

signed graphmatching numberfractional matching numbernonsingular

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Adjacency rank and independence number of a signed graph
• The rank of a signed graph in terms of the rank of its underlying graph
• Relation between the rank of a signed graph and the rank of its underlying graph
• A characterization of signed planar graphs with rank at most 4

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• A characterization of signed planar graphs with rank at most 4
• A note on the nullity of unicyclic signed graphs
• An improved lower bound for the nullity of a graph in terms of matching number
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Further results on the nullity of signed graphs
• Graph theory with applications
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• On the nullity and the matching number of unicyclic graphs
• On the nullity of a graph with cut-points
• On the nullity of bipartite graphs
• Relation between the nullity of a graph and its matching number
• Relation between the rank of a signed graph and the rank of its underlying graph
• Signed graphs with cut points whose positive inertia indexes are two
• Signed graphs with small positive index of inertia
• Spektren endlicher Grafen
• The extremal graphs with respect to their nullity
• The nullity of bicyclic signed graphs
• The rank of a graph after vertex addition
• The rank of a signed graph in terms of the rank of its underlying graph

Cited in

(15)

• Some criteria for a signed graph to have full rank
• A characterization of signed planar graphs with rank at most 4
• The rank of a cograph
• Adjacency rank and independence number of a signed graph
• Characterizations of signed graphs with small ranks
• On the rank of weighted graphs
• Rank decompositions and signed bigraphs
• The gap between the rank of a complex unit gain graph and its underlying graph
• Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
• The rank of a signed graph in terms of the rank of its underlying graph
• Bounds of nullity for complex unit gain graphs
• A study on parity signed graphs: the \(rna\) number
• On connected signed graphs with rank equal to girth
• Relationship between the rank and the matching number of a graph
• Relation between the rank of a signed graph and the rank of its underlying graph

This page was built for publication: The rank of a signed graph

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