Azmi, Madihah and Mustapha, Emy Norfariha and Harun, Asmaa' Amalina
(2016)
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun.
[Student Project]
(Unpublished)
Abstract
Consider two graph G and H. For graph G, let P(G,λ) denote the chromatic polynomial of a graph G and P(H,λ) denote the chromatic polynomial of a graph H. Graph G and H are chromatically equivalent, G ~ H, if P(G,λ) = P(H,λ). A graph G is said to be chromatically unique, x-unique, if for any graph H, H is isomorphic to G, denoted by G ~ H implies G ≅ H. To find the uniqueness of the graph, we will use the theorems and lemmas that have been used by others researchers in finding the k-bridge graph for k ≤ 5. In this project, we have studied about the chromatic uniqueness of a new family of 6-bridge graph which is θ(3,3,3,b,c,c).
Metadata
Item Type: | Student Project |
---|---|
Creators: | Creators Email / ID Num. Azmi, Madihah 2013422246 Mustapha, Emy Norfariha 2013642922 Harun, Asmaa' Amalina 2013276698 |
Contributors: | Contribution Name Email / ID Num. Advisor Mohamad, Siti Nurul Fitriah UNSPECIFIED Advisor Wan RamIi, Wan Khairiyah Hulaini UNSPECIFIED Advisor Yacob, Jusoh UNSPECIFIED Advisor Wan Yusoff, Wan Ruslini UNSPECIFIED |
Subjects: | Q Science > QA Mathematics > Study and teaching Q Science > QA Mathematics > Equations Q Science > QA Mathematics > Analysis |
Divisions: | Universiti Teknologi MARA, Kelantan > Machang Campus > Faculty of Computer and Mathematical Sciences |
Programme: | Mathematics Project (MAT660) |
Keywords: | Graphs, chromatic polynomials, equations, research |
Date: | 2016 |
URI: | https://ir.uitm.edu.my/id/eprint/110580 |
Download
![[thumbnail of 110580.pdf]](https://ir.uitm.edu.my/style/images/fileicons/text.png)
110580.pdf
Download (191kB)
Digital Copy
Digital (fulltext) is available at:


Physical Copy
Physical status and holdings:
Item Status:

ID Number
110580
Indexing

