@article{I_D S T_2022, title={Non skolem mean labeling of a six star graph}, volume={6}, url={https://www.shcpub.in/index.php/cm/article/view/246}, DOI={10.26524/cm134}, abstractNote={<p>A graph G = (V, E) with p vertices and q edges is said to be a <strong>Skolem mean graph </strong>if there exists a function f from the vertex set of G to {1, 2, 3, …, p} such that the induced map f <sup>*</sup> from the edge set of G to {2, 3, 4, …, p} defined by f<sup>∗</sup>(e = uv)=<img src="/public/site/images/admin/gddfgdfg.png"> 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 = 5K<sub>1,2 </sub></p>}, number={1}, journal={Journal of Computational Mathematica}, author={I, Gnanaselvi and D S T, Ramesh}, year={2022}, month={Mar.}, pages={260 - 295} }