Chromatically Unique Bipartite Graphs With Certain 3-independent Partition Numbers III

Roslan, Hasni 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

[img] PDF
330Kb

Abstract

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].

Item Type:Article
Keyword:Chromatic polynomial, Chromatically equivalence, Chromatically unique graphs
Faculty or Institute:Institute for Mathematical Research
Publisher:UPM Press
ID Code:12564
Deposited By: Najwani Amir Sariffudin
Deposited On:03 Jun 2011 07:27
Last Modified:27 May 2013 07:52

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 03 Jun 2011 07:27.

View statistics for "Chromatically Unique Bipartite Graphs With Certain 3-independent Partition Numbers III"


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.