On the Existence of Cn-Supermagic Labelings in Cycle-Based Graph Structures

Tarkan Öner

Makale detayları

On the Existence of Cn-Supermagic Labelings in Cycle-Based Graph Structures

Yazarlar:

Tarkan Öner

Yayıncı:

Tokat Gaziosmanpasa University

Ana Başlıklar:

Pure Mathematics (Other)

Dergi:

Journal of New Results in Science Vol.14 Issue 2, pp.82-99

Belge Tipi:

Makale

Yayın Tarihi:

8/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001357690

pISSN:

1304-7981

Anahtar kelimeler:

Özet:

 In this paper, we prove the existence of Cn-supermagic labeling for the graph Gn, n formed by connecting a vertex of n copies of the Cn n-edge cycle graph to a vertex of a main Cn graph. Labeling functions enable the edges and the vertices of the graph to be labeled with subgraphs that resemble the structure of Cn. Cn-supermagic labeling requires the sum of the labels to be constant for each Cn-cover, and the labels must be uniquely distributed across the graph. The study examines different labelings of Gn, n based on the value of n modulo 4, demonstrating their validity through examples. The results show that such labelings are possible and can be applied consistently for specific values of n.

 In this paper, we prove the existence of Cn-supermagic labeling for the graph Gn, n formed by connecting a vertex of n copies of the Cn n-edge cycle graph to a vertex of a main Cn graph. Labeling functions enable the edges and the vertices of the graph to be labeled with subgraphs that resemble the structure of Cn. Cn-supermagic labeling requires the sum of the labels to be constant for each Cn-cover, and the labels must be uniquely distributed across the graph. The study examines different labelings of Gn, n based on the value of n modulo 4, demonstrating their validity through examples. The results show that such labelings are possible and can be applied consistently for specific values of n.

 In this paper, we prove the existence of Cn-supermagic labeling for the graph Gn, n formed by connecting a vertex of n copies of the Cn n-edge cycle graph to a vertex of a main Cn graph. Labeling functions enable the edges and the vertices of the graph to be labeled with subgraphs that resemble the structure of Cn. Cn-supermagic labeling requires the sum of the labels to be constant for each Cn-cover, and the labels must be uniquely distributed across the graph. The study examines different labelings of Gn, n based on the value of n modulo 4, demonstrating their validity through examples. The results show that such labelings are possible and can be applied consistently for specific values of n.

 In this paper, we prove the existence of Cn-supermagic labeling for the graph Gn, n formed by connecting a vertex of n copies of the Cn n-edge cycle graph to a vertex of a main Cn graph. Labeling functions enable the edges and the vertices of the graph to be labeled with subgraphs that resemble the structure of Cn. Cn-supermagic labeling requires the sum of the labels to be constant for each Cn-cover, and the labels must be uniquely distributed across the graph. The study examines different labelings of Gn, n based on the value of n modulo 4, demonstrating their validity through examples. The results show that such labelings are possible and can be applied consistently for specific values of n.

Makale detayları

On the Existence of Cn-Supermagic Labelings in Cycle-Based Graph Structures

Yazarlar:

Tarkan Öner

Yayıncı:

Tokat Gaziosmanpasa University

Ana Başlıklar:

Pure Mathematics (Other)

Dergi:

Journal of New Results in Science Vol.14 Issue 2, pp.82-99

Belge Tipi:

Makale

Yayın Tarihi:

8/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001357690

pISSN:

1304-7981

Graph labeling

Cn-supermagic labeling

circular graph

magic sum

H-cover

Sayı

Makale detayları

On the Existence of Cn-Supermagic Labelings in Cycle-Based Graph Structures

Yazarlar: Tarkan Öner

Yayıncı: Tokat Gaziosmanpasa University

Ana Başlıklar: Pure Mathematics (Other)

Dergi: Journal of New Results in Science Vol.14 Issue 2, pp.82-99

Belge Tipi: Makale

Yayın Tarihi: 8/2025

Belge Dili: İngilizce

Document ID (Org No.): 2001357690

pISSN: 1304-7981

Graph labeling

Cn-supermagic labeling

circular graph

magic sum

H-cover

Sayı

Yazarlar:

Tarkan Öner

Yayıncı:

Tokat Gaziosmanpasa University

Ana Başlıklar:

Pure Mathematics (Other)

Dergi:

Journal of New Results in Science Vol.14 Issue 2, pp.82-99

Belge Tipi:

Makale

Yayın Tarihi:

8/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001357690

pISSN:

1304-7981