A characterization of graphs with rank 4

DOI10.1016/J.LAA.2010.09.040zbMATH Open1216.05071OpenAlexW1975006923MaRDI QIDQ630525

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

Publication date: 17 March 2011

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

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

zbMATH Keywords

graphrankadjacency matrixspectrumnullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Trees with maximum nullity
• On the nullity of unicyclic graphs
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of line graphs of trees
• Spektren endlicher Grafen
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• On the nullity of graphs with pendent vertices
• Topological approach to the chemistry of conjugated molecules
• A characterization of singular graphs
• On the construction of graphs of nullity one
• Graph transformations which preserve the multiplicity of an eigenvalue
• On the null-spaces of acyclic and unicyclic singular graphs
• On nut and core singular fullerenes
• On the nullity of graphs
• Two-colorable graph states with maximal Schmidt measure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (65)

• Characterization of sub-long graphs of arbitrary rank
• A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
• Triangle-free graphs with six non-zero eigenvalues
• Title not available (Why is that?)
• Line graphs of trees with the largest eigenvalue multiplicity
• Characterizing the negative inertia index of connected graphs in terms of their girth
• On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
• On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
• The extremal graphs with respect to their nullity
• On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\)
• Relation between the trace norm of an oriented graph and its rank
• Proof of a conjecture on the nullity of a graph
• Some criteria for a signed graph to have full rank
• A characterization of signed planar graphs with rank at most 4
• Per-spectral characterizations of graphs with extremal per-nullity
• Maximum nullity and zero forcing number of graphs with rank at most 4
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• A characterization of graphs with rank 5
• 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
• Two spectral extremal results for graphs with given order and rank
• Lower bounds of graph energy in terms of matching number
• Graphs whose distance matrix has at most three negative eigenvalues
• The positive and the negative inertia index of line graphs of trees
• On the rank of weighted graphs
• Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
• On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
• The inertia of weighted unicyclic graphs
• Relation between the skew-rank of an oriented graph and the rank of its underlying graph
• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• Some mixed graphs with \(H\)-rank 4, 6 or 8
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• 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 rank of the distance matrix of graphs
• Extremal spectral radius of graphs with rank 4
• The nullity of bicyclic signed graphs
• A characterization of long graphs of arbitrary rank
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• Proof of a conjecture on extremal spectral radii of blow-up graphs
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• Title not available (Why is that?)
• 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
• A characterization of certain families of 4-valent symmetric graphs
• 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
• Characterizing Graphs with Nullity n-4
• Characterization of oriented graphs of rank 2
• A recursive characterization of the 4-connected graphs
• 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
• The signature ofk-cyclic graphs of ∞-type
• A lower bound for graph energy
• The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
• An improved lower bound for the nullity of a graph in terms of matching number
• Classes of graphs with minimum skew rank 4
• Bounds for the positive and negative inertia index of a graph
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
• On the characterization of digraphs with given rank
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
• Mixed graphs with \(H\)-rank 3

Recommendations

• The \(A_4\)-structure of a graph 👍 👎
• A recursive characterization of the 4-connected graphs 👍 👎
• Characterizing and recognizing 4-map graphs 👍 👎
• A constructive characterization of 4-connected graphs 👍 👎
• On the characterization of digraphs with given rank 👍 👎
• A characterization of \(P_{4}\)-comparability graphs 👍 👎
• A characterization of signed planar graphs with rank at most 4 👍 👎
• A characterization of weakly four‐connected graphs 👍 👎
• Characterizing Graphs with Nullity n-4 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q630525)