Neighbourhood Degree Based Index for Graph Operations Related To Composition
S.Manimekalai1, U.Mary2
1S.Manimekalai, Assistant Professor, Dr. N.G.P. Arts and Science College, Coimbatore.
2U.Mary, Associate Professor & Head, PG & Research Department of Mathematics, Nirmala College for Women (Autonomous), Coimbatore.
Manuscript received on November 12, 2019. | Revised Manuscript received on November 23, 2019. | Manuscript published on 30 November, 2019. | PP: 8723-8728 | Volume-8 Issue-4, November 2019. | Retrieval Number: D8955118419/2019©BEIESP | DOI: 10.35940/ijrte.D8955.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, we have investigated Zagreb index, F-index and neighbourhood degree based index for composition of two connected graphs in which one graph is obtained by using a new graph operation and other is a simple connected graph.
Keywords: Composition, Neighbourhood, Sub Division, Zagreb index, F index, Degree Based Index..
Scope of the Article: Service Discovery and Composition.