On eigensharp and almost eigensharp graphs

DOI10.1016/J.LAA.2008.05.005MaRDI QIDQ952068zbMATH OpenOpenAlexFDO

Authors E. Ghorbani, H. R. Maimani

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) Eigenvalues, singular values, and eigenvectors (15A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• The biclique partition number of some important graphs
• A tree whose complement is not eigensharp
• On the eigensharp of corona product

Cites work

• scientific article; zbMATH DE number 790476 (Why is no real title available?)
• A tree whose complement is not eigensharp
• Biclique decompositions and Hermitian rank
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Eigenspaces of graphs
• Graph theory
• On biclique decompositions of complete \(t\)-partite graphs
• On the Addressing Problem for Loop Switching

Cited in

(8)

• A tree whose complement is not eigensharp
• On the eigensharp of corona product
• Eigenvalues and clique partitions of graphs
• The biclique partition number of some important graphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• On ±1 eigenvectors of graphs
• Eigensharp property of some certain graphs and their complements
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs

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

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