Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A Result on Chromatic Uniqueness of Edge-Gluing of Graphs

G.L. Chia1, Chee-Kit Ho2
1Institute of Mathematical Sciences, University of Malaya 50603 Kuala Lumpur, Malaysia
2Department of Science & Mathematics Universiti Tenaga Nasional, 43009 Kajang, Selangor, Malaysia
  • Published: 31/08/2009

Abstract

In this paper, it is shown that the graph obtained by overlapping the cycle \( C_m \) (\( m \geq 3 \)) and the complete bipartite graph \( K_{3,3} \) at an edge is uniquely determined by its chromatic polynomial.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
G.L. Chia, Chee-Kit Ho. A Result on Chromatic Uniqueness of Edge-Gluing of Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 070. 117-126. .