Pages that link to "Item:Q4580054"
From MaRDI portal
The following pages link to On the relation between the<i>H</i>-rank of a mixed graph and the matching number of its underlying graph (Q4580054):
Displayed 29 items.
- 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)
- Some mixed graphs with \(H\)-rank 4, 6 or 8 (Q2025060) (← links)
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs (Q2099490) (← 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)
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs (Q2185918) (← links)
- On graphs whose orientations are determined by their Hermitian spectra (Q2200431) (← links)
- On mixed graphs whose Hermitian spectral radii are at most 2 (Q2227996) (← 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)
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum (Q2306004) (← links)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431) (← links)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank (Q2419031) (← 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)
- 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)
- Inertia indices of a complex unit gain graph in terms of matching number (Q6104965) (← 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)
- Incidence matrices and line graphs of mixed graphs (Q6172901) (← links)
- On the inertia index of a mixed graph in terms of the matching number (Q6173973) (← links)