Abstract
A decomposition Gi of G is called a linear decomposition or Arithmetic decomposition if each Gi is connected and |E(Gi)| = a+(i − 1)d, for all i = 1,2,3, …, n and a, d ∊ Z. The Arithmetic decomposition with a = 2 and d = 2 is known as Even Decomposition (ED) As the number of edges of sub graph of G are even, we symbolize ED as (G2, G4, …,G2n). A decomposition (P2, P4, P6, …, P2n) of a graph G is an Even Path decomposition (EPD) if |E(P2i)| = 2i for all i = 1,2,3, …, n. Clearly q = n(n+1). This paper deals with Even Path Decomposition (EPD) of Root square mean graphs. Here we use graph labeling technique in Decomposition of Root square mean Graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
