2-Skolem Difference Mean Labeling of Some Graphs
World Scientific News · 05.05.2026 · 1
DOI: 10.65770/nrfm2043 ↗Kurz gefasst
Fachartikel in der Zeitschrift World Scientific News, online erschienen am 05.05.2026. Verfasst von K. Murugan und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben.
Abstract (Originalsprache)
In this article, the concept of 2-Skolem difference mean labeling, relaxed 2-Skolem difference mean labeling, and 2-Skolem difference mean number of a graph are introduced. A graph G=(V,E) with p vertices and 2q edges is said to have 2-Skolem difference mean labeling if it is possible to label the vertices x∈V with distinct elements f(x) from the set {1,2,…,p} in such a way that the edge e=uv is labelled with |f(u)-f(v)|/2 if |f(u)-f(v)| is even, and (|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd, and the resulting labels of the edges are distinct and are from {1,1,2,2,3,3,…q,q}. A graph that admits 2-Skolem difference mean labeling is called a 2-Skolem difference mean graph. The authors studied 2-Skolem difference mean labeling of some graphs.
Zitieren
APA
Murugan, K., & Farzana, S. M. (2026). 2-Skolem Difference Mean Labeling of Some Graphs. World Scientific News, 1. https://doi.org/10.65770/nrfm2043
Vancouver
Murugan K, Farzana SM. 2-Skolem Difference Mean Labeling of Some Graphs. World Scientific News. 2026:1. doi:10.65770/nrfm2043
BibTeX
@article{Murugan2026,
author = {Murugan, K. and Farzana, S. Meeraj},
title = {2-Skolem Difference Mean Labeling of Some Graphs},
journal = {World Scientific News},
year = {2026},
pages = {1},
doi = {10.65770/nrfm2043}
}
EUVIMED