GULBARGA UNIVERSITY, KALABURAGI Institutional Repository
Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5812| Title: | Regular number of a graph |
| Authors: | Kulli V.R Janakiram A Iyer R.R. |
| Issue Date: | 2001 |
| Citation: | Journal of Discrete Mathematical Sciences and Cryptography , Vol. 4 , 1 , p. 57 - 64 |
| Abstract: | 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. © 2001 Taylor & Francis Group, LLC. |
| URI: | 10.1080/09720529.2001.10697919 http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5812 |
| Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.