Total Magic Cordial and Total Sequential Cordial Labeling of Path Related Graph | Chapter 05 | Innovations in Science and Technology Vol. 5

 A graph is defined as G(V,E), with V being the vertex set and E denoting the edge set. A path graph is a simple graph with n number of vertices and n-1 number of edges, with vertices and edges denoted as v1,v2,...vn and edges marked as vivi+1. The cordial related labelling for a certain type of path graph named Square graph of path and Shadow graph of path is discussed in this chapter. Total Sequential Cordial labelling is defined as a mapping f: V U E 0,1 such that for each (a,b) E,f (a,b) =|f(a) - f(b)|, given the condition |f(0) - f(1)|1 holds, where f(0) = vf (0) + ef (0) and f(1) = vf (1) + ef (1) and vf (1), ef (1),i Total magic cordial labelling is defined as if there exists a mapping f: V U E 0,1 such that f(a) + f(b) + f(ab) = Cmod2 for all (a,b) E given the constraint |f(0) - f(1)| 1 holds, where f(0) = vf (0) + ef (0) and f(1) = vf (1) + ef (1) and vf I

Author(S) Details

R. Parameswari
Sathyabama Institute of Science and Technology Chennai, Tamil Nadu, India.

View Book:- https://stm.bookpi.org/IST-V5/article/view/5700