Eigenvalues and clique partitions of graphs
From MaRDI portal
Publication:2040995
DOI10.1016/j.aam.2021.102220zbMath1468.05175OpenAlexW3159340711MaRDI QIDQ2040995
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of a theorem of Graham and Pollak
- On a symmetric representation of Hermitian matrices and its applications to graph theory
- On eigensharp and almost eigensharp graphs
- Clique partitions of the cocktail party graph
- Clique partitions and clique coverings
- Biclique decompositions and Hermitian rank
- Proof of a conjecture of Katona and Tarjan
- Asymptotic values of clique partition numbers
- Inertia and biclique decompositions of joins of graphs
- On the number of distinct minimal clique partitions and clique covers of a line graph
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- A polynomial space proof of the Graham-Pollak theorem
- Eigenvalues and partitionings of the edges of a graph
- On the nullity of connected graphs with least eigenvalue at least -2
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs
- On the decomposition ofkn into complete bipartite graphs
- Sharp bounds for decompositions of graphs into completer-partite subgraphs
- Certain 3-decompositions of complete graphs, with an application to finite fields
- Decomposing Graphs into Edges and Triangles
- The Representation of a Graph by Set Intersections
- On the Addressing Problem for Loop Switching
This page was built for publication: Eigenvalues and clique partitions of graphs
