SEVERAL DISTANCE BASED INDICES FOR COMPLEMENT OF GRAPHS

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.