The rank of a signed graph

DOI10.1016/J.LAA.2022.06.024zbMath1493.05142OpenAlexW4283361668WikidataQ114151353 ScholiaQ114151353MaRDI QIDQ2158295

Qian-Qian Chen, Ji-Ming 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

matching numbersigned graphnonsingularfractional matching number

Mathematics Subject Classification ID

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

Related Items (2)

The gap between the rank of a complex unit gain graph and its underlying graph ⋮ Bounds of nullity for complex unit gain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• On the nullity of a graph with cut-points
• Spektren endlicher Grafen
• Relation between the nullity of a graph and its matching number
• On the nullity and the matching number of unicyclic graphs
• The rank of a graph after vertex addition
• The rank of a signed graph in terms of the rank of its underlying graph
• Signed graphs with cut points whose positive inertia indexes are two
• Further results on the nullity of signed graphs
• A note on the nullity of unicyclic signed graphs
• No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• 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
• A characterization of signed planar graphs with rank at most 4
• Signed graphs with small positive index of inertia
• An improved lower bound for the nullity of a graph in terms of matching number
• Relation between the rank of a signed graph and the rank of its underlying graph
• The nullity of bicyclic signed graphs
• On the nullity of bipartite graphs
• The extremal graphs with respect to their nullity

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