Pages that link to "Item:Q2636822"
From MaRDI portal
The following pages link to Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822):
Displayed 44 items.
- Characterization of graphs with given order, given size and given matching number that minimize nullity (Q271637) (← links)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices (Q323069) (← links)
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\) (Q471950) (← links)
- On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
- Relation between the nullity of a graph and its matching number (Q833002) (← 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)
- Relationship between the rank and the matching number of a graph (Q2011117) (← links)
- Graphs \(G\) with nullity \(2c(G) + p(G) - 1\) (Q2078839) (← links)
- The multiplicities of eigenvalues of a graph (Q2079150) (← links)
- The nullity of a graph with fractional matching number (Q2142661) (← links)
- On connected signed graphs with rank equal to girth (Q2158277) (← links)
- The rank of a signed graph (Q2158295) (← links)
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree (Q2174420) (← 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)
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) (Q2274086) (← 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)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree (Q2332433) (← links)
- Nullities of graphs with given order, matching number and cyclomatic number revisited (Q2408944) (← links)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank (Q2419031) (← links)
- The rank of a complex unit gain graph in terms of the rank of its underlying graph (Q2424827) (← links)
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree (Q2805690) (← 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)
- An improved lower bound for the nullity of a graph in terms of matching number (Q5132620) (← links)
- Upper bounds of the energy of triangle-free graphs in terms of matching number (Q5205762) (← links)
- The relation between the <i>H</i>-rank of a mixed graph and the independence number of its underlying graph (Q5235773) (← links)
- The extremal graphs with respect to their nullity (Q5964879) (← links)
- (Q6104063) (← links)
- Inertia indices of a complex unit gain graph in terms of matching number (Q6104965) (← links)
- (Q6118088) (← links)
- Proof of a conjecture on the nullity of a graph (Q6134647) (← links)
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs (Q6152840) (← links)
- On the difference between the skew-rank of an oriented graph and the rank of its underlying graph (Q6178518) (← links)