Spectral radius and clique partitions of graphs

DOI10.1016/j.laa.2021.07.025zbMath1473.05195arXiv2111.02734OpenAlexW3191908787MaRDI QIDQ820994

N. E. Zubov

Publication date: 29 September 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.02734

zbMATH Keywords

spectral radiusSteiner 2-designclique partitionclique partition number

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Clique partitions and clique coverings
• Proof of a conjecture of Katona and Tarjan
• Asymptotic values of clique partition numbers
• Eigenvalue inequalities and equalities
• Extremal clique coverings of complementary graphs
• Eigenvalues and clique partitions of graphs
• The enumeration of spanning tree of weighted graphs
• On NP-hard graph properties characterized by the spectrum
• Some observations on the smallest adjacency eigenvalue of a graph
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• Eigenvalues and partitionings of the edges of a graph
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Decomposing Graphs into Edges and Triangles
• Short Proofs of Some Extremal Results
• The Representation of a Graph by Set Intersections

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