Open AccessNon skolem mean labeling of a six star graph
Author(s) -
I Gnanaselvi,
D S T Ramesh
Publication year - 2022
Publication title -
journal of computational mathematics
Language(s) - English
Resource type - Journals
ISSN - 2456-8686
DOI - 10.26524/cm134
Subject(s) - combinatorics , graph , vertex (graph theory) , mathematics , graph labeling , star (game theory) , physics , graph power , line graph , mathematical analysis
A graph G = (V, E) with p vertices and q edges is said to be a Skolem mean graph if there exists a function f from the vertex set of G to {1, 2, 3, …, p} such that the induced map f * from the edge set of G to {2, 3, 4, …, p} defined by f∗(e = uv)= then the resulting edges get distinct labels from the set {2, 3, 4, …, p}.In this paper we prove that the six star graph G = 5K1,2