Title of article
PI polynomials of product graphs
Author/Authors
Loghman، نويسنده , , A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
975
To page
979
Abstract
The Padmakar–Ivan (PI) index of a graph G is defined as P I ( G ) = ∑ [ n e u ( e | G ) + n e v ( e | G ) ] , where n e u ( e | G ) is the number of edges of G lying closer to u than to v , n e v ( e | G ) is the number of edges of G lying closer to v than to u and summation goes over all edges of G . In this work, the PI polynomial for the Cartesian product graphs is computed.
Keywords
PI index , PI polynomial , Hamming graph , Connected graph , Product graph
Journal title
Applied Mathematics Letters
Serial Year
2009
Journal title
Applied Mathematics Letters
Record number
1526018
Link To Document