The biclique partition number of some important graphs

MaRDI QIDQ5228717zbMATH OpenFDO

Authors Eman Rawshdeh, H. Al-Ezeh

Publication date 12 August 2019

Full work available at URL http://ijpam.uniud.it/online_issue/201941/24-Eman%20Rawshdeh-Hasan%20AlEzeh.pdf

zbMATH Keywords

line graphtree graphcliquecomplete graphcomplete bipartite graphbicliquebiclique partition number\(k\)th-power of a cycle\(k\)th-power of a path

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On eigensharp and almost eigensharp graphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• Bicliques and eigenvalues
• A tree whose complement is not eigensharp
• Computation of the biclique partition number for graphs with specific blocks

Cited in

(8)

• On eigensharp and almost eigensharp graphs
• On the biclique partition of the corona and joins of graphs
• Computation of the biclique partition number for graphs with specific blocks
• A tree whose complement is not eigensharp
• Finding biclique partitions of co-chordal graphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• scientific article; zbMATH DE number 4130401 (Why is no real title available?)
• Eigensharp property of some certain graphs and their complements

This page was built for publication: The biclique partition number of some important graphs

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