Changing Behavior of Vertices of Some Graphs
Keywords:
Fan Graph, Jewel Graph, Octopus Graph, Near Skolem Difference Mean Labeling.Abstract
Let be a graph and be an injection. For each edge the induced edge labeling is defined as follows:
Then is called Near Skolem difference mean labeling if are all distinct and are from. A graph that admits a Near Skolem difference mean labeling is called a Near Skolem difference mean graph. In this paper, a new parameter is introduced and verified for some graphs.
References
- F.Harary, Graph Theory, Narosa Publishing House, New Delhi, (2001).
- J. A.Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, 15(2008),DS6.
- S. Shenbaga Devi, A. Nagarajan, Near Skolem Difference Mean Labeling of cycle related Graphs, International Journal for Science and Advance Research in Technology, Volume 3 Issue 12 – December 2017, pages 1037-1042
- S. Shenbaga Devi and A. Nagarajan, Near Skolem Difference Mean labeling of some special types of trees, International Journal of Mathematics Trends and Technology, Volume 52 Number 7 December 2017, pages 474-478
- S. Shenbaga Devi and A. Nagarajan, Near Skolem Difference Mean Labeling of some Subdivided graphs. (Communicated)
- S. Shenbaga Devi and A. Nagarajan, Some Results on Duplication of Near Skolem Difference Mean graph C_n. (Communicated)
- S. Shenbaga Devi and A. Nagarajan, On Near Skolem Difference Mean Graphs (Communicated).
- S. Shenbaga Devi and A. Nagarajan, On Changing behavior of edges of some special classes of graphs I (Communicated)
Downloads
Published
2018-02-28
Issue
Section
Research Articles
License
Copyright (c) IJSRSET
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
[1]
S. Shenbaga Devi, A. Nagarajan "Changing Behavior of Vertices of Some Graphs" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099,
Volume 4, Issue 1, pp.400-405, January-February-2018.