On eigensharp and almost eigensharp graphs

DOI10.1016/J.LAA.2008.05.005zbMath1171.05033OpenAlexW2170644761MaRDI QIDQ952068

Hamid Reza Maimani, Ebrahim Ghorbani

Publication date: 6 November 2008

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

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

zbMATH Keywords

products of graphsalmost eigensharp graphseigensharp graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

Unnamed Item ⋮ Eigenvalues and clique partitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biclique decompositions and Hermitian rank
• On biclique decompositions of complete \(t\)-partite graphs
• A tree whose complement is not eigensharp
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: On eigensharp and almost eigensharp graphs