A characterization of graphs with rank 5

DOI10.1016/J.LAA.2012.01.021zbMath1241.05062OpenAlexW2918013612MaRDI 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

Applications of graph theory (05C90) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (53)

Characterization of graphs with given order, given size and given matching number that minimize nullity ⋮ Triangle-free graphs with six non-zero eigenvalues ⋮ Graphs \(G\) with nullity \(n(G) - g(G) -1\) ⋮ 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 ⋮ 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 ⋮ On connected signed graphs with rank equal to girth ⋮ An upper bound of the nullity of a graph in terms of order and maximum degree ⋮ On the rank of the distance matrix of graphs ⋮ Proof of a conjecture on extremal spectral radii of blow-up 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 ⋮ Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows ⋮ Some criteria for a signed graph to have full rank ⋮ A note on the nullity of unicyclic signed graphs ⋮ A characterization of long graphs of arbitrary rank ⋮ 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 ⋮ On the rank of weighted graphs ⋮ Relation between the trace norm of an oriented graph and its rank ⋮ Line graphs of trees with the largest eigenvalue multiplicity ⋮ The positive and the negative inertia index of line graphs of trees ⋮ A lower bound for graph energy ⋮ On the nullity of the line graph of unicyclic graph with depth one ⋮ The inertia of weighted unicyclic graphs ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ On the multiplicities of normalized Laplacian eigenvalues of graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ The nullity of bicyclic signed graphs ⋮ Mixed graphs with \(H\)-rank 3 ⋮ Relationship between the rank and the matching number of a graph ⋮ Characterization of oriented graphs of rank 2 ⋮ No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) ⋮ The signature ofk-cyclic graphs of ∞-type ⋮ Some mixed graphs with \(H\)-rank 4, 6 or 8 ⋮ On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ Relation between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ The extremal graphs with respect to their nullity ⋮ 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 ⋮ The leaf-free graphs with nullity \(2 c ( G ) - 1\) ⋮ Characterization of sub-long graphs of arbitrary rank ⋮ Relation between the rank of a signed graph and the rank of its underlying graph ⋮ 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 \(k\)-generalized Hermitian adjacency matrices for mixed graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities

Cites Work

This page was built for publication: A characterization of graphs with rank 5