The regular number of a graph

Details The regular number of a graph The regular number of a graph

2011-11-29

arxiv.org/abs/1111.6836v1

Computer Science

Discrete Mathematics

Scientific paper

Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ 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.

Affiliated with

Also associated with

No associations

Rating

The regular number of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The regular number of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The regular number of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16570