In this paper we investigate the existence of E-cordial, Product E-cordial and Signed Product cordial labelings for twig related graph by presenting algorithm.

1.
R.
Avudainayaki
,
B.
Selvam
,
P.P.
Ulaganathan
,
” E-cordial and Product E-cordial labeling for the extended duplicate graph of splitting graph ofpath”,
National Conference on Mathematical Techniques and its Applications(NCMTA 18)
.
2.
R.
Avudainayaki
,
B.
Selvam
,
P.P.
Ulaganathan
,
’’Signed Product cordial and Even Sum Cordial Labeling for the Extended Duplicate Graph of Splitting Graph of Path
'',
International Journal of Mathematics and its Applications
, Vol
5
, Issue
1-B
,
123
128
, (
2017
).
3.
Gallian
J. A.
,
“A dynamic survey of graph labeling”,
The Electronic Journal of Combinatorics
18
,
#DS6
, (
2018
).
4.
K.
Thirusangu
,
B.
Selvam
and
P.P.
Ulaganathan
,
’’Cordial labeling in Extended Duplicate Twig graphs ”,
International Journal of Computer, Mathematical Sciences and Applications
,
4
(
3-4
),,
319
328
, (
2010
).
5.
Nikhil
Parmar
,
Dr. Dharamvirsinh
parmar
,
International Journal for Research in Allied Science & Engineering Technology
,
’’Product Cordial of Barycentric subdivision of Cn
”, Vol
5
Issue
VIII
, August (
2017
).
6.
Rosa
A.
, “
On certain valuations of the vertices of a graph
”,
Theory of graphs (Internat. Symposium, Rome, July 1996)
, Gordon and Breach, N.Y. and Dunod Paris,
349
355
, (
1967
).
This content is only available via PDF.
You do not currently have access to this content.