Even Path Decomposition of Cyclic Snake Graphs

Authors

  • E. Ebin Raja Merly Research Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamil Nadu, India.
  • J. Suthiesh Goldy Department of Mathematics, Muslim Arts College, Thiruvithancode, Tamil Nadu, India.

DOI:

https://doi.org/10.9734/bpi/ratmcs/v4/1267G

Keywords:

Even path decomposition, odd cyclic snake graphs, triangular snake graph, even cyclic snake graphs, diamond snake graph, base path

Abstract

An Even Decomposition (G2, G4, G6, …, G2n) of G is said to be an Even Path Decomposition (EPD) if each G2i is a path of size 2i and it is denoted by (P2,P4, P6, …, P2n). In this chapter, we introduced the concept Even Path Decomposition of Cyclic Snake Graphs.

Published

2023-09-09

How to Cite

E. Ebin Raja Merly, & J. Suthiesh Goldy. (2023). Even Path Decomposition of Cyclic Snake Graphs. Research and Applications Towards Mathematics and Computer Science Vol. 4, 62–72. https://doi.org/10.9734/bpi/ratmcs/v4/1267G

Issue

Research and Applications Towards Mathematics and Computer Science Vol. 4

Section

Chapters