Research Article | OPEN ACCESS
X-Domatic Partition of Bipartite Graphs
1Y.B. Venkatakrishnan, 2V. Swaminathan and 1K. Kannan
1Department of Mathematics, SASTRA University, Tanjore, India 613 401
2Ramanujan Research Center, S.N. College, Madurai, India
Research Journal of Applied Sciences, Engineering and Technology 2013 2:646-648
Received: May 24, 2012 | Accepted: June 23, 2012 | Published: January 11, 2013
Abstract
In this study, we define X-domatic partition of a bipartite graph. X-domatic number of a unicyclic graph is less than or equal to 3 is proved. Nordhaus Gaddum type of results involving X-domatic number are obtained and the graphs for which $d_x(G) + d_x(\bar G) = 2P, d_x(G) + d_x(\bar G ) = 2P - 1$, are characterized.
Keywords:
X-domatic partition, X-dominating set, Y-dominating set,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
