Relation between the rank of a signed graph and the rank of its underlying graph
From MaRDI portal
Recommendations
- The rank of a signed graph in terms of the rank of its underlying graph
- A characterization of signed planar graphs with rank at most 4
- Adjacency rank and independence number of a signed graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- The rank of a signed graph
Cites work
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A characterization of signed planar graphs with rank at most 4
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- A note on the nullity of unicyclic signed graphs
- Bounds for the least Laplacian eigenvalue of a signed graph
- Further results on the nullity of signed graphs
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On the Laplacian coefficients of signed graphs
- On the Laplacian Eigenvalues of Signed Graphs
- On the notion of balance of a signed graph
- On the nullity of a graph with cut-points
- On the nullity of graphs
- On the rank of multicyclic graphs
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Signed graphs
- Signed graphs with small positive index of inertia
- Signed graphs, root lattices, and Coxeter groups
- Skew-rank of an oriented graph in terms of matching number
- Spectral characterizations of signed lollipop graphs
- Spectral criterion for cycle balance in networks
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- The minimum rank of symmetric matrices described by a graph: a survey
- The rank of a graph after vertex addition
Cited in
(18)- The rank of a signed graph in terms of the rank of its underlying graph
- 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
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Some criteria for a signed graph to have full rank
- Adjacency rank and independence number of a signed graph
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- A characterization of signed planar graphs with rank at most 4
- Characterizations of signed graphs with small ranks
- On the rank of weighted graphs
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph
- The inertia indices of a signed graph in terms of the inertia indices of its underlying graph
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- The gap between the rank of a complex unit gain graph and its underlying graph
- Relation between the rank of a signed graph and the fractional matching number of its underlying graph
- The left row rank of quaternion unit gain graphs in terms of girth
This page was built for publication: Relation between the rank of a signed graph and the rank of its underlying graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240732)
