Eigenvalues of complete multipartite graphs. (English) Zbl 1246.05097
Summary: We compute the eigenvalues of the complete multipartite graph and present some applications of our result.
MSC:
| 05C50 | Graphs and linear algebra (matrices, eigenvalues, etc.) |
| 05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |
References:
| [1] | Aigner, M., Discrete Mathematics (2007), American Mathematical Society: American Mathematical Society Providence, Translated from German by D. Kramer · Zbl 1119.05001 |
| [2] | Graham, R. L.; Pollak, H. O., (Graph Theory and Applications, Proc. Conf. Western Michigan Univ.. Graph Theory and Applications, Proc. Conf. Western Michigan Univ., Lect. Notes in Math., vol. 303 (1972)), 99-110 · Zbl 0251.05123 |
| [3] | Haemers, W., Eigenvalue techniques in design and graph theory, (Mathematical Centre Tracts, vol. 121 (1980), Mathematisch Centrum: Mathematisch Centrum Amsterdam) · Zbl 0429.05013 |
| [4] | Tverberg, H., On the decomposition of \(K_n\) into complete bipartite graphs, J. Graph Theory, 6, 493-494 (1982) · Zbl 0502.05048 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
