Publication Type:

Journal Article

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

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.

Notes:

cited By (since 1996)0

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.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS
  • Amrita on Social Media

  • Contact us

    Amrita Vishwa Vidyapeetham
    Amritanagar, Coimbatore - 641 112
    Tamilnadu, India
    • Fax: +91-422-2686274
    • Coimbatore : +91 (422) 2685000
    • Amritapuri   : +91 (476) 280 1280
    • Bengaluru    : +91 (080) 251 83700
    • Kochi              : +91 (484) 280 1234
    • Mysuru          : +91 (821) 234 3479
    • Contact Details »