Eigenvalues and clique partitions of graphs

DOI10.1016/J.AAM.2021.102220MaRDI QIDQ2040995zbMATH OpenOpenAlexFDO

Authors Jiang Zhou, Changjiang Bu

Publication date 15 July 2021

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2021.102220

zbMATH Keywords

clique partitionclique partition numbergraph spectrarestricted clique partition number

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)

Recommendations

• Spectral radius and clique partitions of graphs
• On the partition and coloring of a graph by cliques
• scientific article; zbMATH DE number 3885943
• scientific article; zbMATH DE number 3914369
• Clique coverings and partitions of line graphs

Cites work

• A new proof of a theorem of Graham and Pollak
• A polynomial space proof of the Graham-Pollak theorem
• An introduction to the theory of graph spectra
• Asymptotic values of clique partition numbers
• Biclique decompositions and Hermitian rank
• Certain 3-decompositions of complete graphs, with an application to finite fields
• Clique partitions and clique coverings
• Clique partitions of the cocktail party graph
• Decomposing graphs into edges and triangles
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Eigenvalues and partitionings of the edges of a graph
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 3623599 (Why is no real title available?)
• scientific article; zbMATH DE number 3395950 (Why is no real title available?)
• Inertia and biclique decompositions of joins of graphs
• On a problem of G. O. H. Katona and T. Tarján
• On a symmetric representation of Hermitian matrices and its applications to graph theory
• On eigensharp and almost eigensharp graphs
• On the Addressing Problem for Loop Switching
• On the Decomposition of Graphs
• On the decomposition ofkn into complete bipartite graphs
• On the nullity of connected graphs with least eigenvalue at least -2
• On the number of distinct minimal clique partitions and clique covers of a line graph
• Proof of a conjecture of Katona and Tarjan
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The Representation of a Graph by Set Intersections

Cited in

(8)

• Laplacian eigenvalues and partition problems in hypergraphs
• Bicliques and eigenvalues
• Connectivity and eigenvalues of graphs with given girth or clique number
• On eigenfunctions and maximal cliques of generalised Paley graphs of square order
• Spectra of total graphs
• Unified bounds for the independence number of graphs
• Some eigensharp and almost eigensharp graphs
• Spectral radius and clique partitions of graphs

This page was built for publication: Eigenvalues and clique partitions of graphs

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