The rank of a signed graph
DOI10.1016/J.LAA.2022.06.024zbMATH Open1493.05142OpenAlexW4283361668WikidataQ114151353 ScholiaQ114151353MaRDI QIDQ2158295FDOQ2158295
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
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
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)
Cites Work
- Graph theory with applications
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- Title not available (Why is that?)
- On the nullity of bipartite graphs
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- The rank of a graph after vertex addition
- A characterization of signed planar graphs with rank at most 4
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- The extremal graphs with respect to their nullity
- An improved lower bound for the nullity of a graph in terms of matching number
- Relation between the nullity of a graph and its matching number
- The rank of a signed graph in terms of the rank of its underlying graph
- Further results on the nullity of signed graphs
- A note on the nullity of unicyclic signed graphs
- Signed graphs with small positive index of inertia
- The nullity of bicyclic signed graphs
- 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
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
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
- Bounds of nullity for complex unit gain graphs
- The rank of a signed graph in terms of the rank of its underlying graph
- 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)
