Spectral radius and clique partitions of graphs
Combinatorics
2021-11-05 v1
Abstract
We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint -cliques. The extremal graphs attaining the bounds are exactly the block graphs of Steiner -designs and the regular graphs with -decompositions, respectively.
Keywords
Cite
@article{arxiv.2111.02734,
title = {Spectral radius and clique partitions of graphs},
author = {Jiang Zhou and Edwin R. van Dam},
journal= {arXiv preprint arXiv:2111.02734},
year = {2021}
}