Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows

DOI10.1016/J.LAA.2012.06.027MaRDI QIDQ389670zbMATH OpenOpenAlexFDO

Authors Liang-Hao Huang, Bit-Shun Tam, Shu-Hui Wu

Publication date 21 January 2014

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.06.027

zbMATH Keywords

adjacency matrixcographneighborhood equivalence classesnumber of distinct nonzero rowsrankreduced adjacency matrixreduced graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• The rank of a cograph
• On the rank of a cograph
• Some relations between rank of a graph and its complement
• On the minimum rank of the join of graphs and decomposable graphs
• A characterization of graphs with rank 5

Cites work

• A characterization of graphs with rank 4
• A characterization of graphs with rank 5
• Eigenspaces of graphs
• Graph Classes: A Survey
• Graph derivatives
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 540115 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• Matrix Analysis
• On the rank of a cograph
• The minimum rank of matrices and the equivalence class graph
• The neighborhood inclusion structure of a graph
• The rank of a cograph
• Theorems on partitioned matrices revisited and their applications to graph spectra
• Unoriented Laplacian maximizing graphs are degree maximal

Cited in

(11)

• Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)
• Graphs \(G\) with nullity \(n(G) - g(G) -1\)
• On connected signed graphs with rank equal to girth
• On the nullity of a connected graph in terms of order and maximum degree
• Cographs: eigenvalues and Dilworth number
• On the algorithmic complexity of zero-sum edge-coloring
• \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
• Graphs with least eigenvalue -2: ten years on
• Spectral properties of cographs and P₅-free graphs
• On connected graphs of order n with girth g and nullity n-g
• On the rank of a cograph

This page was built for publication: Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows

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