Pages that link to "Item:Q2302068"
From MaRDI portal
The following pages link to Adjacency rank and independence number of a signed graph (Q2302068):
Displaying 10 items.
- The rank of a signed graph in terms of the rank of its underlying graph (Q1680298) (← links)
- On connected signed graphs with rank equal to girth (Q2158277) (← links)
- The rank of a signed graph (Q2158295) (← links)
- Some criteria for a signed graph to have full rank (Q2185913) (← links)
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree (Q2228099) (← links)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank (Q2419031) (← links)
- A characterization of signed planar graphs with rank at most 4 (Q2805665) (← links)
- Bounds for the rank of a complex unit gain graph in terms of the independence number (Q5073035) (← links)
- On the relation between the adjacency rank of a complex unit gain graph and the matching number of its underlying graph (Q5080252) (← links)
- Relation between the rank of a signed graph and the rank of its underlying graph (Q5240732) (← links)
