The following pages link to The rank and size of graphs (Q4894621):
Displayed 30 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Maximal and extremal singular graphs (Q690526) (← links)
- The maximum order of adjacency matrices of graphs with a given rank (Q690659) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Some relations among term rank, clique number and list chromatic number of a graph (Q856854) (← links)
- Constructing and classifying neighborhood anti-Sperner graphs (Q998422) (← links)
- On the rank of a matrix associated with a graph. (Q1422421) (← links)
- On order and rank of graphs (Q1701307) (← links)
- Maximum order of trees and bipartite graphs with a given rank (Q1759390) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Rank, term rank and chromatic number of a graph (Q1764180) (← links)
- Chromatic number and the 2-rank of a graph (Q1850515) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
- On automorphisms of direct products of Cayley graphs on abelian groups (Q2040002) (← links)
- Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
- Maximum order of graphs with a given corank (Q2174436) (← links)
- Maximal graphs with respect to rank (Q2219972) (← links)
- Conformally covariant operators and conformal invariants on weighted graphs (Q2256269) (← links)
- Edge-transitive graphs of small order and the answer to a 1967 question by Folkman (Q2278591) (← links)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree (Q2332433) (← links)
- Real symmetric matrices and their negative eigenvalues (Q2668061) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- (Q5090939) (← links)
- Maximum Order of Triangle‐Free Graphs with a Given Rank (Q5251207) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph (Q6098089) (← links)
- Automorphisms of the double cover of a circulant graph of valency at most 7 (Q6119494) (← links)
- A discrete variation of the Littlewood-Offord problem (Q6194235) (← links)