On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles

@article{Chia2001OnTC,
  title={On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles},
  author={Gek Ling Chia and Chee-Kit Ho},
  journal={Ars Comb.},
  year={2001},
  volume={60}
}
In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial. ) 3 ( ≥ m Cm 2 , 2 , 2 K Let G be a finite graph with neither loops nor multiple edges and let ) ; ( λ G P denote its chromatic polynomial. Then G is said to be chromatically unique if ) ; ( ) ; ( λ λ G Y P = implies that Y is isomorphic to G. Let n K and denote a complete graph and a cycle respectively on n vertices. The… CONTINUE READING

From This Paper

Topics from this paper.
1 Citations
17 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

On the chromatic uniqueness of edge-gluing of complete bipartite graphs and cycles

  • G. L. Chia, C.-K. Ho
  • Ars Combinat
  • 2001
2 Excerpts

On the chromatic uniqueness of graphs with connectivity two

  • G. L. Chia
  • Malaysian J. Science
  • 1995
1 Excerpt

Algebraic Graph Theory

  • N. L. Biggs
  • 1994

Connectivity and chromatic uniqueness

  • R. C. Read
  • Ars Combinat
  • 1987
1 Excerpt

Some notes on chromatic uniqueness of graphs, (Chinese, English summary)

  • S.-J. Xu
  • J. Shanghai Teach. Univ., Nat. Sci. Ed
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…