∆-DECOMPOSITION OF PERFECT FACTO GRAPHS AND OTHER GRAPHS

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published Oct 6, 2013
E. Giftin Vedha Merly, N. Gnanadhas, P.Thangavelu

Abstract

A decomposition of a graph  is a collection of subgraphs  of  such that every edge of  belongs to exactly one .The -decomposition of a graph  is defined by imposing the condition on the maximum degree of the members of the decomposition. The minimum cardinality of the -decomposition is called the -decomposition number of  and is denoted by . In this paper, we initiate the study of the parameter and obtain the upper bound of for perfect facto graphs and some standard graphs. Also we obtain the upper bound of for these graphs.

How to Cite

∆-DECOMPOSITION OF PERFECT FACTO GRAPHS AND OTHER GRAPHS. (2013). Asian Journal of Current Engineering and Maths, 1(4). http://informaciontechnologica.com/index.php/ajcem/article/view/91
Abstract 121 | PDF Downloads 102

##plugins.themes.bootstrap3.article.details##

Section
Articles

How to Cite

∆-DECOMPOSITION OF PERFECT FACTO GRAPHS AND OTHER GRAPHS. (2013). Asian Journal of Current Engineering and Maths, 1(4). http://informaciontechnologica.com/index.php/ajcem/article/view/91