Staff View: Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari

Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari

A chromatic polynomial is denoted as P(G, λ ) while for graph H is P(G, λ ). Both graph of G and H are equivalently chromatic can be written in the form of P( G, λ ) = P(H, λ ). The chromatically unique of H, G ~ H that implies the graph G is an isomorphic to graph H. The multigraph are also known a...

Full description

Saved in:

Bibliographic Details
Main Authors:	Wan Ahmad Saidi, Wan Noor Ain, Muhammad, Nurul Syafika, Juhari, Fakhira
Format:	Student Project
Language:	English
Published:	2016
Subjects:	Study and teaching Equations Analysis
Online Access:	https://ir.uitm.edu.my/id/eprint/110579/1/110579.pdf https://ir.uitm.edu.my/id/eprint/110579/
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uitm.ir.110579
record_format	eprints
spelling	my.uitm.ir.1105792025-02-25T09:25:18Z https://ir.uitm.edu.my/id/eprint/110579/ Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari Wan Ahmad Saidi, Wan Noor Ain Muhammad, Nurul Syafika Juhari, Fakhira Study and teaching Equations Analysis A chromatic polynomial is denoted as P(G, λ ) while for graph H is P(G, λ ). Both graph of G and H are equivalently chromatic can be written in the form of P( G, λ ) = P(H, λ ). The chromatically unique of H, G ~ H that implies the graph G is an isomorphic to graph H. The multigraph are also known as a multi edges graph. Two different vertices which connected with every edge will also connected with other edges. The multigraph with two vertices and k edges is denotes as θk. In addition, a multi-bridge graph or a k- bridge graph are also known as the subdivision of θk. In this study we continue to solve a new problem of chromaticity of 6-bridge graph, that is θ(3,3,3,3,b,c) and prove the chromatic uniqueness of a new family of 6-bridge graphs. 2016 Student Project NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/110579/1/110579.pdf Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari. (2016) [Student Project] <http://terminalib.uitm.edu.my/110579.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 Wan Ahmad Saidi, Wan Noor Ain Muhammad, Nurul Syafika Juhari, Fakhira Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
description	A chromatic polynomial is denoted as P(G, λ ) while for graph H is P(G, λ ). Both graph of G and H are equivalently chromatic can be written in the form of P( G, λ ) = P(H, λ ). The chromatically unique of H, G ~ H that implies the graph G is an isomorphic to graph H. The multigraph are also known as a multi edges graph. Two different vertices which connected with every edge will also connected with other edges. The multigraph with two vertices and k edges is denotes as θk. In addition, a multi-bridge graph or a k- bridge graph are also known as the subdivision of θk. In this study we continue to solve a new problem of chromaticity of 6-bridge graph, that is θ(3,3,3,3,b,c) and prove the chromatic uniqueness of a new family of 6-bridge graphs.
format	Student Project
author	Wan Ahmad Saidi, Wan Noor Ain Muhammad, Nurul Syafika Juhari, Fakhira
author_facet	Wan Ahmad Saidi, Wan Noor Ain Muhammad, Nurul Syafika Juhari, Fakhira
author_sort	Wan Ahmad Saidi, Wan Noor Ain
title	Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
title_short	Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
title_full	Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
title_fullStr	Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
title_full_unstemmed	Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari
title_sort	technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / wan noor ain wan ahmad saidi, nurul syafika muhammad and fakhira juhari
publishDate	2016
url	https://ir.uitm.edu.my/id/eprint/110579/1/110579.pdf https://ir.uitm.edu.my/id/eprint/110579/
_version_	1825165204360527872
score	13.239859

Technical report: the chromatic uniqueness of a family of 6-bridge graphs θ(3,3,3,3,b,c) / Wan Noor Ain Wan Ahmad Saidi, Nurul Syafika Muhammad and Fakhira Juhari

Similar Items