Chromatic polynomials of graphs resulting from some binary operations / Hounam B. Copel
Material type:
TextPublication details: Iligan City : Mindanao State University-Iligan Institute of Technology ,2018.Description: x, 121 leaves 27 x 21cmSubject(s): Online resources: Abstract: This paper presents results on the chromatic polynomials ofsome graphs.
In particular, the chromatic polynomials of graphs resulting from binary
operations such as join and corona were obtained. The join of two familiar
graphs have chromatic polynomials whose coefficients involve binomial
coefficients. In fact, most of the graphs have chromatic polynomials which
can be expressed as alternating series. In addition, the chromatic polynomial
of the corona of graphs, !Kr-gluing of complete graphs, the lollipop graph and
tadpole graph were also obtained. As a consequence, the chromatic number,
denoted by x(G) of every graph G considered in this paper is also obtained.
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
CHED Funded Research
|
Commission on Higher Education CHED Funded research | LG 995 2018 C6 C67 (Browse shelf(Opens below)) | Available | CHEDFR-000320 | |||
Digital Thesis and Dissertations
|
Commission on Higher Education Digital Thesis and Dissertation | Digital Thesis and Dissertation | LG 995 2018 C6 C67 (Browse shelf(Opens below)) | Available (Room Use Only) | DCHEDFR-000073 |
Thesis (Master of Science in Mathematics) -- Mindanao State University-Iligan Institute of Technology, April 2018
This paper presents results on the chromatic polynomials ofsome graphs.
In particular, the chromatic polynomials of graphs resulting from binary
operations such as join and corona were obtained. The join of two familiar
graphs have chromatic polynomials whose coefficients involve binomial
coefficients. In fact, most of the graphs have chromatic polynomials which
can be expressed as alternating series. In addition, the chromatic polynomial
of the corona of graphs, !Kr-gluing of complete graphs, the lollipop graph and
tadpole graph were also obtained. As a consequence, the chromatic number,
denoted by x(G) of every graph G considered in this paper is also obtained.
There are no comments on this title.
Click on an image to view it in the image viewer