|
|
|
|
Chromaticity of 6-bridge Graph θ(3,3,b,b,c,c)
|
|
|
|
|
|
|
|
نویسنده
|
abd karim n.s. ,hasni r.
|
|
منبع
|
malaysian journal of mathematical sciences - 2016 - دوره : 10 - شماره : S - صفحه:155 -166
|
|
چکیده
|
For a graph g,let p(g,λ) denote the chromatic polynomial of g. two graphs g and h are chromatically equivalent (or simply x-equivalent),denoted by g∼h,if p(g,λ) = p(h,λ). a graph g is chromatically unique (or simply x-unique) if for any graph h such that h∼g,we have h ≅ g,that is,h is isomorphic to g. in this paper,the chromatic uniqueness of a family of 6-bridge graph is determined.
|
|
کلیدواژه
|
6-bridge graph; Chromatic polynomial; Chromatically unique
|
|
آدرس
|
department of mathematics,faculty of science and mathematics,universiti pendidikan sultan idris,tanjung malim perak, Malaysia, school of informatics and applied mathematics,universiti malaysia terengganu,kuala terengganu,terengganu, Malaysia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|