ARITHMETIC ODD DECOMPOSITION OF SPIDER TREE
##plugins.themes.bootstrap3.article.main##
##plugins.themes.bootstrap3.article.sidebar##
Abstract
Let G = (V, E) be a simple connected graph with p vertices and q edges. If G1,G2,…,Gn are connected edge-disjoint subgraphs of G with E(G)=E(G1)E(G2)…E(Gn), then (G1, G2, …, Gn) is said to be a decomposition of G. A decomposition (G1, G2,…,Gn) of G is said to be continuous monotonic decomposition(CMD) if each Gi is connected and |E(Gi)|=i, for every  i=1, 2, 3, …,n. A decomposition (G1, G2, …, Gn)of G is said to be Arithmetic decomposition(AD) if |E(Gi)| = a+ (i-1)d for every i=1, 2, 3, …, n and a, dÎZ+. An arithmetic odd decomposition (AOD) is an arithmetic decomposition with a = 1 and d = 2. We denote the AOD by (G1, G3, …, G2n-1). In this paper we study the AOD of spider tree.
Â
AMS Subject Classification: 05C99.
How to Cite
##plugins.themes.bootstrap3.article.details##
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.â€