Abstract

Here our discussion is on a three star graph which is finite, simple and undirected one. For notations and terminology, we follow [1]. The vertex set and the edge set of a graph G are denoted by V (G) and E (G) respectively. So G(V,E) is a graph with p vertices and q edges. Much work is done by researchers on Mean labeling and Super mean labeling of graphs applying them on a variety of graphs [2-7,9,10]. Motivated by these work the concept of SSML(V4,E2) on a two star graph was introduced by Uma Maheshwari et al [8]. After a discussion on SSML(V4,E2) on a two star graphs, we were inspired to apply SSML(V4,E2) on three star graphs and hence this paper. Here the word sub is used thereby allowing omissions which lead to repetitions and a special case SSML(V4,E2). A study on omissions and repetitions on a three star graphs is done which admits SSML(V4,E2) and the formula is obtained in terms of, mand n in this paper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.