Search

Your search keyword '"Bu, Changjiang"' showing total 157 results
Start Over Author "Bu, Changjiang" Search Limiters Peer Reviewed
157 results on '"Bu, Changjiang"'

42. The high order spectrum of a graph and its applications in graph colouring and clique counting.

Author

Liu, Chunmeng, Zhou, Jiang, and Bu, Changjiang

Subjects
HOMOGENEOUS polynomials, EIGENVALUES, SPECTRAL theory, EQUATIONS, COUNTING
Abstract

D. Cvetković, M. Doob and H. Sachs considered the high order eigenvalue problems of graphs. The high order eigenvalues of a graph G are solutions of the high degree homogeneous polynomial equations derived from G. We propose the adjacency tensor A (G) of a graph G and show that the high order eigenvalues of G can be regarded as eigenvalues of A (G). Some results of the spectrum of the adjacency matrix are extended to the spectrum of A (G) by using the spectral theory of nonnegative tensors. An upper bound of chromatic number is given via the spectral radius of A (G). Our upper bound is a generalization of Wilf's bound χ (G) ≤ ρ (G) + 1 (where ρ (G) is the spectral radius of the adjacency matrix of a graph G) and sharper than the bound of Wilf in some classes of graphs. A formula of the number of cliques of fixed size which involve the spectrum of A (G) is obtained. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results