Even path decomposition of root square mean graphs

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...

Full description

Saved in:
Bibliographic Details
Published in:AIP conference proceedings 2022-11, Vol.2516 (1)
Main Authors: Aswathy, H., Sandhya, S.S.
Format: Article
Language:English
Subjects:
Arithmetic
Decomposition
Graph theory
Graphs
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0109068