Pages that link to "Item:Q1931744"
From MaRDI portal
The following pages link to A characterization of long graphs of arbitrary rank (Q1931744):
Displaying 20 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)
- An upper bound of the nullity of a graph in terms of order and maximum degree (Q1654407) (← links)
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph (Q1732760) (← links)
- Complex unit gain graphs of rank 2 (Q2174098) (← links)
- Characterization of oriented graphs of rank 2 (Q2272483) (← 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)
- The positive and the negative inertia index of line graphs of trees (Q2435520) (← links)
- The signature of<i>k</i>-cyclic graphs of ∞-type (Q2787602) (← links)
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree (Q2805690) (← links)
- Nullity of a graph in terms of path cover number (Q4959297) (← links)
- Characterization of sub-long graphs of arbitrary rank (Q4975119) (← links)
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph (Q5065538) (← links)
- Characterizations of graphs with given inertia index achieving the maximum diameter (Q5122485) (← links)
- An improved lower bound for the nullity of a graph in terms of matching number (Q5132620) (← 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)
- Minimal graphs with eigenvalue multiplicity of \(n-d\) (Q6615417) (← links)