Open AccessOn a Question of Prime Labeling of Graphs
Author(s) -
A. M. C. U. M. Athapattu,
P. G. R. S. Ranasinghe
Publication year - 2021
Publication title -
journal of advances in mathematics and computer science
Language(s) - English
Resource type - Journals
ISSN - 2456-9968
DOI - 10.9734/jamcs/2021/v36i130333
Subject(s) - combinatorics , edge graceful labeling , graph labeling , mathematics , magic (telescope) , planar graph , undirected graph , discrete mathematics , graph , prime (order theory) , graph power , line graph , physics , quantum mechanics
In the field of graph theory, the complete graph of vertices is a simple undirected graph such that every pair of distinct vertices is connected by a unique edge. In the present work, we introduce planar subgraph of with maximal number of edges . Generally, does not admit prime labeling. We present an algorithm to obtain prime-labeled subgraphs of . We conclude the paper by stating two conjectures based on labeling of . In particular, the planar subgraph admits anti-magic labeling but does not admit edge magic total labeling.