• TRIANGULAR DIVISOR CORDIAL LABELING FOR SOME STANDARD GRAPHS
Abstract
Let be a - graph. A Triangular divisor cordial labeling of a graph G with vertex set V is a bijection where is the Triangular number such that if each edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a Triangular divisor cordial labeling, then it is called Triangular divisor cordial graph. In this paper, we proved the standard graphs such as Switching a pendant vertex in path wheel, Flower graph A book with rectangular pages, A book with pentagonal pages, Shell Umbrella , The tensor product graph are Triangular divisor cordial graphs.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |