A characterization of graphs with rank 5

DOI10.1016/j.laa.2012.01.021zbMath1241.05062MaRDI QIDQ414705

Gerard Jennhwa Chang, Hong-Gwa Yeh, Liang-Hao Huang

Publication date: 11 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.01.021

zbMATH Keywords

graph; spectrum; adjacency matrix; rank; nullity

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C40: Connectivity

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Characterization of sub-long graphs of arbitrary rank, A lower bound for graph energy, An improved lower bound for the nullity of a graph in terms of matching number, Relation between the rank of a signed graph and the rank of its underlying graph, The nullity of bicyclic signed graphs, Relation between the skew-rank of an oriented graph and the rank of its underlying graph, The extremal graphs with respect to their nullity, The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5, Triangle-free graphs with six non-zero eigenvalues, Two spectral extremal results for graphs with given order and rank, On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs, Proof of a conjecture on the nullity of a graph, A survey of the maximal and the minimal nullity in terms of omega invariant on graphs, Relation between the trace norm of an oriented graph and its rank, Line graphs of trees with the largest eigenvalue multiplicity, Characterization of graphs with given order, given size and given matching number that minimize nullity, Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices, Characterization of graphs whose signature equals the number of odd cycles, Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows, On the nullity of the line graph of unicyclic graph with depth one, Per-spectral characterizations of graphs with extremal per-nullity, Mixed graphs with \(H\)-rank 3, On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph, An upper bound of the nullity of a graph in terms of order and maximum degree, A note on the nullity of unicyclic signed graphs, A characterization of long graphs of arbitrary rank, Relationship between the rank and the matching number of a graph, Some mixed graphs with \(H\)-rank 4, 6 or 8, The \(k\)-generalized Hermitian adjacency matrices for mixed graphs, A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities, Graphs \(G\) with nullity \(n(G) - g(G) -1\), On connected signed graphs with rank equal to girth, On the rank of the distance matrix of graphs, Complex unit gain graphs of rank 2, On the characterization of digraphs with given rank, Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree, Some criteria for a signed graph to have full rank, On the multiplicities of normalized Laplacian eigenvalues of graphs, On the nullity of a connected graph in terms of order and maximum degree, Characterization of oriented graphs of rank 2, 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\), The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices, A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree, The positive and the negative inertia index of line graphs of trees, The inertia of weighted unicyclic graphs, On the algorithmic complexity of zero-sum edge-coloring, Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank, Proof of a conjecture on extremal spectral radii of blow-up graphs, The signature ofk-cyclic graphs of ∞-type, A characterization of signed planar graphs with rank at most 4, An upper bound for the nullity of a bipartite graph in terms of its maximum degree, On the rank of weighted graphs

Cites Work