Divided Cube Difference Cordial Labeling of Graphs

ISBN-13: 9786205489239 / Angielski / Miękka / 76 str.

M. Antony Arockiasamy; P. Thirupathi

Opis

Graph Labeling is one of the fastest developing and largest applied field in higher level Mathematical research. This book opens a horizon of a new labeling technique named as "Divided Cube Difference Cordial Labeling" and investigates the family of staircase graphs, Aztec diamond graphs for possible results. Paths, stars, bistars, corona graphs, trees, complement of complete bipartite graphs are proved to satisfy this new labeling method. Arbitrary subdivisions of a tree Tn are examined and shown to be divided cube difference cordial. This research work throughs open the opportunity for further investigation of possible other graphs which are still not explored with respect to this new labeling technique..

O autorze

Dr. M. Antony Arockiasamy has eighteen years of teaching experience and fourteen years of research experience in Graph Theory. His area of interest includes graph labeling, coding theory, cryptography, probability theory, DNA Computing etc. At present, he is working as faculty of Mathematics at Sacred Heart College, Tirupattur, Tamilnadu, India.