ON SIGMA-POLYNOMIALS AND A CLASS OF CHROMATICALLY UNIQUE GRAPHS

Authors
Citation
Qy. Du, ON SIGMA-POLYNOMIALS AND A CLASS OF CHROMATICALLY UNIQUE GRAPHS, Discrete mathematics, 115(1-3), 1993, pp. 153-165
Citations number
7
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
0012365X
Volume
115
Issue
1-3
Year of publication
1993
Pages
153 - 165
Database
ISI
SICI code
0012-365X(1993)115:1-3<153:OSAACO>2.0.ZU;2-4
Abstract
Let sigma(G)=SIGMA(i=0)ka(i)sigma(k-i) the sigma-polynomial of a graph G. We ask the question: When k and a1 are given, what is the largest possible value of a(i)(0 less-than-or-equal-to i less-than-or-equal-to k) for any graph G? In this paper, this question is answered and the extremal graphs are characterized. So, the results in [3,6] are genera lized.