Zumkeller Labeling of Complete Graphs
-
Published:2019-12-31
Issue:1S3
Volume:9
Page:352-355
-
ISSN:2249-8958
-
Container-title:International Journal of Engineering and Advanced Technology
-
language:en
-
Short-container-title:IJEAT
Abstract
Let G (V, E) be a graph with vertex set V and edge set E. The process of assigning natural numbers to the vertices of G such that the product of the numbers of adjacent vertices of G is a Zumkeller number on the edges of G is known as Zumkeller labeling of G. This can be achieved by defining an appropriate vertex function of G. In this article, we show the existence of this labeling to complete graph and fan graph.
Publisher
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Subject
Computer Science Applications,General Engineering,Environmental Engineering
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Studies on some wheel related Zumkeller graphs;INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021);2022