Pages that link to "Item:Q5962847"
From MaRDI portal
The following pages link to Skew-rank of an oriented graph in terms of matching number (Q5962847):
Displaying 39 items.
- Relation between the skew-rank of an oriented graph and the independence number of its underlying graph (Q724735) (← links)
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph (Q725520) (← links)
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- The rank of a signed graph in terms of the rank of its underlying graph (Q1680298) (← links)
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph (Q1732760) (← links)
- Relation between the skew energy of an oriented graph and its matching number (Q1786884) (← links)
- Energy, matching number and odd cycles of graphs (Q2002697) (← links)
- Relationship between the rank and the matching number of a graph (Q2011117) (← links)
- Complex unit gain graphs of rank 2 (Q2174098) (← links)
- On the characterization of digraphs with given rank (Q2174415) (← links)
- Relations between the inertia indices of a mixed graph and those of its underlying graph (Q2174430) (← links)
- The rank of a complex unit gain graph in terms of the matching number (Q2174475) (← links)
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree (Q2228099) (← links)
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\) (Q2229516) (← links)
- Characterization of oriented graphs of rank 2 (Q2272483) (← links)
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs (Q2273886) (← links)
- Adjacency rank and independence number of a signed graph (Q2302068) (← links)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\) (Q2306583) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- Upper bound of skew energy of an oriented graph in terms of its skew rank (Q2418984) (← links)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank (Q2419031) (← links)
- Spectral norm of oriented graphs (Q2419052) (← links)
- Skew-rank of an oriented graph and independence number of its underlying graph (Q2424807) (← links)
- The rank of a complex unit gain graph in terms of the rank of its underlying graph (Q2424827) (← links)
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond (Q2666583) (← links)
- On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph (Q4580054) (← links)
- Nullity of a graph in terms of path cover number (Q4959297) (← links)
- Bounds on the nullity, the <i>H</i>-rank and the Hermitian energy of a mixed graph (Q4959321) (← links)
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph (Q4965923) (← links)
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph (Q5023803) (← links)
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph (Q5065538) (← 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)
- An improved lower bound for the nullity of a graph in terms of matching number (Q5132620) (← links)
- The relation between the <i>H</i>-rank of a mixed graph and the independence number of its underlying graph (Q5235773) (← links)
- Relation between the rank of a signed graph and the rank of its underlying graph (Q5240732) (← links)
- Proof of a conjecture on the nullity of a graph (Q6134647) (← links)
- Relation between the trace norm of an oriented graph and its rank (Q6168554) (← links)
- On the inertia index of a mixed graph in terms of the matching number (Q6173973) (← links)