Signed Edge Total Domination on Rooted Product Graphs

Abstract

Let G be a rooted product graph of path with a cycle graph with the vertex set V and the edge set E. Here n P be a Path with n vertices and m C (3) m ≥ be a cycle with a sequence of n rooted graphs m1 m2 m3 mn C ,C ,C ,-,C. We call n m P (C) the rooted product of n P by m C and it is denoted by n m P C o. Every i th vertex of n P is merging with any one vertex in every i th copy of m C. In this paper we discuss some results on rooted product graph of path with a cycle graph.

Note on Wing Symmetric n-Sigraphs

“…The following characterization of i-balanced n-sigraphs is obtained in [10]. In [10], the authors also have defined switching and cycle isomorphism of an n-sigraph Sn = (G, σ) as follows: (See also [1,4,5,[7][8][9][12][13][14][15][16][17][18][19][20][21][22][23])…”

Common Minimal Common Neighborhood Dominating Symmetric n-Sigraphs

“…In [10], the authors also have defined switching and cycle isomorphism of an n-sigraph Sn = (G, σ) as follows: (See also [4][5][6][7][8][9][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25])…”

Equitable Symmetric n-Sigraphs

“…In [10], the authors also have defined switching and cycle isomorphism of an n-sigraph Sn = (G, σ) as follows: (See also [1,4,5,[7][8][9][12][13][14][15][16][17][18][19][20][21][22][23])…”