1. IR @ Gulbarga University
  2. Faculty Publications
  3. 1. Journal Articles
Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5812
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulli V.R
dc.contributor.authorJanakiram A
dc.contributor.authorIyer R.R.
dc.date.accessioned2020-06-12T15:08:55Z-
dc.date.available2020-06-12T15:08:55Z-
dc.date.issued2001
dc.identifier.citationJournal of Discrete Mathematical Sciences and Cryptography , Vol. 4 , 1 , p. 57 - 64en_US
dc.identifier.uri10.1080/09720529.2001.10697919
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5812-
dc.description.abstractThe 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.en_US
dc.titleRegular number of a graphen_US
dc.typeArticle
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.