Publication Type : Journal Article
Publisher : Journal of Discrete Mathematical Sciences and Cryptography
Source : Journal of Discrete Mathematical Sciences and Cryptography, Taylor & Francis, Volume 15, Number 2-3, p.149–157 (2012)
Keywords : generalized graph colorings, minimum regular partition of an edge set, Regular number of a graph, the degree bound
Campus : Coimbatore
School : School of Engineering
Department : Mathematics
Verified : Yes
Year : 2012
Abstract : Let be a simple undirected graph. The regular number of is defined to be the minimum number of subsets into which the edge set of can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain the regular number of some graphs and obtain some bounds on this parameter. Also, some of the bounds proved in [5] are shown here to hold with equality.
Cite this Research Publication : A. Ganesan and Iyer, R. R., “The regular number of a graph”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 15, pp. 149–157, 2012.