Regular number of subdivision of a graph

AUTHOR AND
AFFILIATION

M.H. MUDDEBIHAL1, ABDUL GAFFAR2 and SHABBIR AHMED3
1,3Professor, Department of Mathematics, Gulbarga University, Gulbarga, 585 106 Karnataka (India)
2Research Scholar, Department of Mathematics, Gulbarga University, Gulbarga, 585 106 Karnataka (India)
Email: mhmuddebihal@yahoo.co.in,abdul.gaffar1704@yahoo.com,glbhyb09@rediffmail.com

KEYWORDS:

subdivision graph

Issue Date:

April 2015

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.27 – No.1

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

For any (p ,q) graph G,a subdivision graph S(G) is obtained from G by subdividing each edge of G. The regular number of a S(G) is the minimum number of subsets into which the edge set of S(G) should be partitioned so that the subgraph induced by each subset is regular and is denoted by (G) . In this paper some results on regular number of (G) were obtained and expressed in terms of elements of G.

Copy the following to cite this Article:

M.H. MUDDEBIHAL1, ABDUL GAFFAR2 and SHABBIR AHMED3, “Regular number of subdivision of a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 1, Page Number , 2016


Copy the following to cite this URL:

M.H. MUDDEBIHAL1, ABDUL GAFFAR2 and SHABBIR AHMED3, “Regular number of subdivision of a graph”, Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 1, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/321/


For any (p ,q) graph G,a subdivision graph S(G) is obtained from G by subdividing each edge of G. The regular number of a S(G) is the minimum number of subsets into which the edge set of S(G) should be partitioned so that the subgraph induced by each subset is regular and is denoted by (G) . In this paper some results on regular number of (G) were obtained and expressed in terms of elements of G.