Date of Publication
9-1994
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Severino Gervacio
Defense Panel Chair
Yolando Beronque
Defense Panel Member
Severino Diesto
Arlene Pascasio
Abstract/Summary
Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is chromatically unique if P(G,y) = P(H,y) implies that H is isomorphic to G. It is proven that complements of partial matching forest are chromatically unique. An infinite family of counterexamples to the conjecture that all regular graphs are chromatically unique is constructed. It is shown that the coefficients of chromatic polynomials of certain connected graphs, relative to the three basis, do not exhibit the strong logarithmic concavity property. Many of the coefficients have equal absolute values.
Abstract Format
html
Language
English
Format
Accession Number
TG02237
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
[98] leaves
Keywords
Polynomials; Analytic functions; Graph theory; Mathematics--Formulae; Groups, Theory of
Upload Full Text
wf_yes
Recommended Citation
Aves, L. A. (1994). On chromatic polynomials of regular graphs and modified wheels. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/1550
