On eigensharpness and almost eigensharpness of lexicographic products of some graphs

DOI10.4134/BKMS.B210416MaRDI QIDQ5089695zbMATH OpenFDO

Authors Ahmad Abbasi, Mona Gholamnia Taleshani

Publication date 15 July 2022

zbMATH Keywords

lexicographic product of graphsbiclique partition numbereigensharp graphs

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On eigensharp and almost eigensharp 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 3290993 (Why is no real title available?)
• Biclique decompositions and Hermitian rank
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Handbook of product graphs
• On eigensharp and almost eigensharp graphs
• On the Addressing Problem for Loop Switching
• On the group of the composition of two graphs
• Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
• Spectra of graphs
• The composition of graphs

Cited in

(6)

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

This page was built for publication: On eigensharpness and almost eigensharpness of lexicographic products of some graphs

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