Strong Modular Sumset Number of Graphs when Vertices are Assigned with Sets of Cardinality Two

Authors

  • Udayan M. Prajapati
  • K. I. Vyas

Keywords:

Sumset labeling, modular sumset labeling, strong modular sumset labeling, strong modular sumset number of a graph.

Abstract

For a positive integer n, let Zn be the set of all non-negative integers modulo n and P(Zn) be its power set. A graph that admits strong modular sumset labeling is called a strong modular sumset graph. The strong modular sumset number of a graph is the minimum cardinality required for the ground set Zn so that the graph admits a strong modular sumset labeling and hence is a strong modular
sumset graph. In this paper, we determine strong modular sumset labeling and the strong modular sumset number of graphs when vertices are assigned with sets of cardinality two.

Key words and phrases. Sumset labeling, modular sumset labeling, strong modular sumset labeling, strong modular sumset number of a graph.

2000 Mathematics Subject Classification. 05C78, 11B13

Downloads

Published

2025-05-18

How to Cite

Udayan M. Prajapati, & K. I. Vyas. (2025). Strong Modular Sumset Number of Graphs when Vertices are Assigned with Sets of Cardinality Two. Jordan Journal of Mathematics and Statistics, 14(4), 637–650. Retrieved from https://jjms.yu.edu.jo/index.php/jjms/article/view/773

Issue

Vol. 14 No. 4 (2021)

Section

Articles