Regular number of a graph
V. R. Kulli, A. Janakiram, Radha R. Iyer · Journal of Discrete Mathematical Sciences and Cryptography · 2001
The regular number r(G) of a graph G is the minimum number of subsets into which the edge set of G should be partitioned so that the subgraph induced by each subset is regular. In this chapter some results regarding the regular number r(G) of a graph are established. Also a new parameter edge set independence number of a graph G is defined.