Skip to content
Research Article Open access CC BY 4.0

On a Question of Prime Labeling of Graphs

A. M. C. U. M. Athapattu, P. G. R. S. Ranasinghe

Journal of Advances in Mathematics and Computer Science · pp. 87–93 · Published 15 Mar 2021

10.9734/jamcs/2021/v36i130333

Abstract

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.

Planar graph prime labeling anti-magic labeling edge magic total labeling

References (6)

  1. 1 A Dynamic Survey of Graph Labeling [DOI]
  2. 2 A theorem on trees [DOI]
  3. 3 HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. [DOI]
  4. 4 Supermagic Complete Graphs [DOI]
  5. 5 Regularisable graphs, II [DOI]
  6. 6 Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings [DOI]

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

21

Page views

0

PDF downloads

13

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.