The regular number of a graph
Discrete Mathematics
2015-12-11 v1 Combinatorics
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 families of graphs and discuss some general bounds on this parameter. Also, some of the lower or upper bounds proved in \cite{Kulli:Janakiram:Iyer:2001} are shown here to hold with equality.
Keywords
Cite
@article{arxiv.1111.6836,
title = {The regular number of a graph},
author = {Ashwin Ganesan and Radha R. Iyer},
journal= {arXiv preprint arXiv:1111.6836},
year = {2015}
}