Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun
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,...
Saved in:
Main Authors: | , , |
---|---|
Format: | Student Project |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | https://ir.uitm.edu.my/id/eprint/110580/1/110580.pdf https://ir.uitm.edu.my/id/eprint/110580/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uitm.ir.110580 |
---|---|
record_format |
eprints |
spelling |
my.uitm.ir.1105802025-02-25T09:22:24Z https://ir.uitm.edu.my/id/eprint/110580/ Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun Azmi, Madihah Mustapha, Emy Norfariha Harun, Asmaa' Amalina Study and teaching Equations Analysis 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). 2016 Student Project NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/110580/1/110580.pdf Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun. (2016) [Student Project] <http://terminalib.uitm.edu.my/110580.pdf> (Unpublished) |
institution |
Universiti Teknologi Mara |
building |
Tun Abdul Razak Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Mara |
content_source |
UiTM Institutional Repository |
url_provider |
http://ir.uitm.edu.my/ |
language |
English |
topic |
Study and teaching Equations Analysis |
spellingShingle |
Study and teaching Equations Analysis Azmi, Madihah Mustapha, Emy Norfariha Harun, Asmaa' Amalina Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
description |
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). |
format |
Student Project |
author |
Azmi, Madihah Mustapha, Emy Norfariha Harun, Asmaa' Amalina |
author_facet |
Azmi, Madihah Mustapha, Emy Norfariha Harun, Asmaa' Amalina |
author_sort |
Azmi, Madihah |
title |
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
title_short |
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
title_full |
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
title_fullStr |
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
title_full_unstemmed |
Technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / Madihah Azmi, Emy Norfariha Mustapha and Asmaa' Amalina Harun |
title_sort |
technical report: chromaticity of 6-bridge graph θ(3,3,3,b,c,c) / madihah azmi, emy norfariha mustapha and asmaa' amalina harun |
publishDate |
2016 |
url |
https://ir.uitm.edu.my/id/eprint/110580/1/110580.pdf https://ir.uitm.edu.my/id/eprint/110580/ |
_version_ |
1825165204549271552 |
score |
13.239859 |