∆-DECOMPOSITION OF PERFECT FACTO GRAPHS AND OTHER GRAPHS

Cite this:
P.Thangavelu, E. G. V. M. N. G. (2013). ∆-DECOMPOSITION OF PERFECT FACTO GRAPHS AND OTHER GRAPHS. Asian Journal of Current Engineering and Maths, 1(4). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/91
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
122
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

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.

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”