Eigenvalues and clique partitions of graphs
type: Item
instance of: scholarly article
title: Eigenvalues and clique partitions of graphs
zbMATH Open document ID: 1468.05175
author: Jiang Zhou
author: Changjiang Bu
published in: Advances in Applied Mathematics
publication date: 2021-07-15T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7371804
zbMATH Keywords: graph spectra
zbMATH Keywords: clique partition
zbMATH Keywords: clique partition number
zbMATH Keywords: restricted clique partition number
MaRDI profile type: Publication
full work available at URL: j.aam.2021.102220
OpenAlex ID: W3159340711
cites work: On the Decomposition of Graphs
cites work: The graphs with all but two eigenvalues equal to \(\pm 1\)
cites work: Q3642517
cites work: Clique partitions and clique coverings
cites work: The Representation of a Graph by Set Intersections
cites work: On eigensharp and almost eigensharp graphs
cites work: On the Addressing Problem for Loop Switching
cites work: Q5663904
cites work: Inertia and biclique decompositions of joins of graphs
cites work: Clique partitions of the cocktail party graph
cites work: Sharp bounds for decompositions of graphs into completer-partite subgraphs
cites work: Biclique decompositions and Hermitian rank
cites work: Q4186355
cites work: On a problem of G. O. H. Katona and T. Tarján
cites work: Eigenvalues and partitionings of the edges of a graph
cites work: Proof of a conjecture of Katona and Tarjan
cites work: Decomposing Graphs into Edges and Triangles
cites work: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
cites work: On the number of distinct minimal clique partitions and clique covers of a line graph
cites work: Q4152571
cites work: A new proof of a theorem of Graham and Pollak
cites work: Certain 3-decompositions of complete graphs, with an application to finite fields
cites work: On a symmetric representation of Hermitian matrices and its applications to graph theory
cites work: On the decomposition ofkn into complete bipartite graphs
cites work: A polynomial space proof of the Graham-Pollak theorem
cites work: Asymptotic values of clique partition numbers
cites work: On the nullity of connected graphs with least eigenvalue at least -2
DOI: 10.1016/J.AAM.2021.102220
description: scientific article; zbMATH DE number 7371804