A characterization of graphs with rank 5
From MaRDI portal
Publication:414705
DOI10.1016/J.LAA.2012.01.021zbMATH Open1241.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
Applications of graph theory (05C90) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Algorithmic graph theory and perfect graphs
- 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
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- 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
- 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
- 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 (56)
- The extremal graphs with respect to their nullity
- Relation between the trace norm of an oriented graph and its rank
- Proof of a conjecture on the nullity of a graph
- Characterization of sub-long graphs of arbitrary 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
- A characterization of signed planar graphs with rank at most 4
- Per-spectral characterizations of graphs with extremal per-nullity
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Triangle-free graphs with six non-zero eigenvalues
- 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
- Title not available (Why is that?)
- 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
- On the algorithmic complexity of zero-sum edge-coloring
- Complex unit gain graphs of rank 2
- On the rank of the distance matrix of graphs
- Line graphs of trees with the largest eigenvalue multiplicity
- 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
- 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
- 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
- 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
- A survey of the maximal and the minimal nullity in terms of omega invariant on graphs
- On the \({A_{\!\mathbb{C}}}\)-rank of multidigraphs
- On claw-free graphs with all but four eigenvalues equal to \(0\) or \(-1\)
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)
