A characterization of graphs with rank 5
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 1983913 (Why is no real title available?)
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- A characterization of graphs with rank 4
- A characterization of singular graphs
- A note on graphs with zero nullity
- Algorithmic graph theory and perfect graphs
- Graph theory
- Graph transformations which preserve the multiplicity of an eigenvalue
- Nullity of graphs
- On nut and core singular fullerenes
- On the characterization of graphs with pendent vertices and given nullity
- On the construction of graphs of nullity one
- On the null-spaces of acyclic and unicyclic singular graphs
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of graphs with pendent vertices
- On the nullity of line graphs of trees
- On the nullity of tricyclic graphs
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Spektren endlicher Grafen
- Trees with maximum nullity
Cited in
(67)- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- The extremal graphs with respect to their nullity
- Relation between the trace norm of an oriented graph and its rank
- The maximum order of adjacency matrices of graphs with a given rank
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- Some criteria for a signed graph to have full rank
- Proof of a conjecture on the nullity of a graph
- Characterization of sub-long graphs of arbitrary rank
- Per-spectral characterizations of graphs with extremal per-nullity
- A characterization of signed planar graphs with rank at most 4
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Algebraic characterization of strongly connected graphs
- On the nullity of the line graph of unicyclic graph with depth one
- An upper bound of the nullity of a graph in terms of order and maximum degree
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
- Employing star complements in search for graphs with fixed rank
- Triangle-free graphs with six non-zero eigenvalues
- On the rank of multicyclic graphs
- scientific article; zbMATH DE number 1910735 (Why is no real title available?)
- Two spectral extremal results for graphs with given order and rank
- The positive and the negative inertia index of line graphs of trees
- Existence of a non-zero (0, 1)-vector in the row space of adjacency matrices of simple graphs
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- On the rank of weighted graphs
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- scientific article; zbMATH DE number 841561 (Why is no real title available?)
- The inertia of weighted unicyclic graphs
- Graphs \(G\) with nullity \(n(G) - g(G) -1\)
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Complex unit gain graphs of rank 2
- On the algorithmic complexity of zero-sum edge-coloring
- On the rank of the distance matrix of graphs
- On triangle-free graphs with rank 7
- Line graphs of trees with the largest eigenvalue multiplicity
- Unicyclic and bicyclic graphs of rank 4 or 5
- The nullity of bicyclic signed graphs
- A characterization of long graphs of arbitrary rank
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Relation between the rank of a signed graph and the fractional matching number of its underlying graph
- On the multiplicities of normalized Laplacian eigenvalues of graphs
- Proof of a conjecture on extremal spectral radii of blow-up graphs
- On connected signed graphs with rank equal to girth
- Characterization of graphs whose signature equals the number of odd cycles
- On the nullity of a connected graph in terms of order and maximum degree
- Relationship between the rank and the matching number of a graph
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Characterization of oriented graphs of rank 2
- Non rank 3 strongly regular graphs with the 5-vertex condition
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- A note on the nullity of unicyclic signed graphs
- Relation between the rank of a signed graph and the rank of its underlying graph
- A lower bound for graph energy
- The signature of k-cyclic graphs of -type
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- Maximum order of triangle-free graphs with a given rank
- On the rank of a cograph
- An improved lower bound for the nullity of a graph in terms of matching number
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
- On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
- On the characterization of digraphs with given rank
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
- Mixed graphs with \(H\)-rank 3
This page was built for publication: A characterization of graphs with rank 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414705)
