SEVERAL DISTANCE BASED INDICES FOR COMPLEMENT OF GRAPHS

S. Parameswari; K. Balasangu

S. Parameswari Department of Mathematics, Arignar Anna Govt Arts college, Villupuram - 605752, Tamil Nadu, INDIA

K. Balasangu Department of Mathematics, Thiru kolanjiappar Govt Arts college, Viruthachalam - 606001, Tamil Nadu, INDIA

Volume 16, Issue 1A Pages 131-136 May 1, 2020 197 downloads

Article overview

Abstract

A graph G is said to have property P if for every pair of its adjacent vertices x and y there exists a vertex z such that z is not adjacent to x and y: In this paper, we establish an explicit formula to calculate the several graph indices for the complement of any graph G having above property. As a corollary we obtain the several graph indices for the complement of certain derived graphs.

Keywords and Phrases

Topological indexdistancederived graph.

AMS Subject Classification

05C12, 05C76.

Reference information

How to Cite

S. Parameswari, K. Balasangu (2020). SEVERAL DISTANCE BASED INDICES FOR COMPLEMENT OF GRAPHS. South East Asian Journal of Mathematics and Mathematical Sciences, 16(1A), 131-136.

Back to this issue