Arithmetic Odd Star Decomposition of Graphs

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) \(\cup\)E(G2)\(\cup\)….\(\cup\)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 if each Gi is connected and |E(Gi)| = i for every i = 1, 2, …., n. [1]. In this chapter, we introduced the concept Arithmetic odd star decomposition. A decomposition (G1, G2, ……, Gn) of G is said be an Arithmetic decomposition if |E(Gi) = a + (i-1)d, for every I = 1, 2 ……, n and a, d \(\in\) Z. Clearly q=\(\frac{n}{2}\)[2a + (n - 1) d]. If a = 1 and d = 1, then q = \(\frac{n(n+1)}{2}\). In this chapter, we study the graphs with a = 1 and d = 2. Then q = n2. That is, the number of edges of G is a perfect square.