Simple Search:

Chromatically unique bipartite graphs with certain 3-independent partition numbers III


Citation

Hasni @ Abdullah, Roslan and Peng, Yee Hock (2007) Chromatically unique bipartite graphs with certain 3-independent partition numbers III. Malaysian Journal of Mathematical Sciences, 1 (1). pp. 139-162. ISSN 1823-8343

Abstract / Synopsis

For integers p, q, s with p ≥ q ≥ 2 and s ≥ 0 , let ( ) 2 , K−s p q denote the set of 2_connected bipartite graphs which can be obtained from K(p,q) by deleting a set of s edges. In this paper, we prove that for any graph ( ) 2 G∈K−s p,q with p ≥ q ≥ 3 and 1 ≤ s ≤ q - 1 if the number of 3-independent partitions of G is 2p-1 + 2q-1 + s + 4, then G is chromatically unique. This result extends both a theorem by Dong et al.[2]; and results in [4] and [5].


Download File

[img]
Preview
PDF
page_139-162.pdf

Download (338kB)

Additional Metadata

Item Type: Article
Divisions: Institute for Mathematical Research
Publisher: Universiti Putra Malaysia Press
Keywords: Chromatic polynomial; Chromatically equivalence; Chromatically unique graphs
Depositing User: Najwani Amir Sariffudin
Date Deposited: 03 Jun 2011 15:27
Last Modified: 27 May 2015 10:06
URI: http://psasir.upm.edu.my/id/eprint/12564
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item