No Detail Found!

Padmakar-Ivan index of some types of perfect graphs

Author(s)
Manju Sankaramalil Chithrabhanu Department of Mathematics, Amrita School of Arts and Science,Kochi, Amrita Vishwa Vidyapeetham,India
Kanagasabapathi Somasundaram Department of Mathematics, Amrita School of Engineering,Coimbatore, Amrita Vishwa Vidyapeetham,India
Abstract
The Padmakar-Ivan (PI) index of a graph G is defined as P I(G) = Pe2E(G) (jV (G)j NG(e)), where NG(e) is the number of equidistant vertices for the edge e. A graph is perfect if for every induced subgraph H, the equation (H) = ! (H) holds, where (H) is the chromatic number and ! (H) is the size of a maximum clique of H. In this paper, the PI index of some types of perfect graphs is obtained. These types include co-bipartite graphs, line graphs, and prismatic graphs.
Publication Details
Page(s) 92-99
Published Journal: Discrete Mathematics Letters, Volume: 9, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
line graphs, co-bipartite graphs, PI index, prismatic graphs
0

Citations

0

Downloads

43

Views