No Detail Found!

Chromatic uniqueness of complete bipartite graphs with certain edges deleted ii.

Author(s)
R. Hasni School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Penang, Malaysia
Y. H. Peng Department of Mathematics, Institute for Mathematical Research, Universiti Putra Malaysia, 43400 UPM Serdang, Malaysis
Abstract
For integers p, q, s with p ≥ q ≥ 2 and s ≥ ³ 0, let K2-s(p,q) denote the set of 2-connected bipartite graphs which can be obtained from Kp,q by deleting a set of s edges. In this paper, we prove that for any graph G ? K2 -s (p,q) with p ≥ q ≥ 3, if 11 ≤ s ≤ q –1 and ?(G1) = s -4, where G1 = Kp,q  – G, then G is chromatically unique. This result extends both a theorem by Dong et al. [2] and the result in [4].
Publication Details
Page(s) 1-8
DOI DOI not available
Published Journal: Punjab University Journal of Mathematics, Volume: 43, Issue: 0, Year: 2011

Request the full text from PASTIC

0

Citations

0

Downloads

49

Views