𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The PI index of product graphs

✍ Scribed by H. Yousefi-Azari; B. Manoochehrian; A.R. Ashrafi

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
178 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

The Padmakar-Ivan index of a graph G is the sum over all edges uv of G of number of edges which are not equidistant from u and v. In this work, an exact expression for the PI index of the Cartesian product of bipartite graphs is computed. Using this formula, the PI indices of C 4 nanotubes and nanotori are computed.

πŸ“œ SIMILAR VOLUMES

Extremal graphs with respect to the vert
Extremal graphs with respect to the vertex PI index
✍ M.J. Nadjafi-Arani; G.H. Fath-Tabar; A.R. Ashrafi πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 377 KB

The vertex PI index of a graph G is the sum over all edges uv ∈ E(G) of the number of vertices which are not equidistant to u and v. In this paper, the extremal values of this new topological index are computed. In particular, we prove that for each n-vertex graph 2 , where x denotes the greatest i

The PI Index of polyomino chains
The PI Index of polyomino chains
✍ Lixing Xu; Shubo Chen πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 213 KB

The PI index is a graph invariant defined as the summation of the sums of n eu (e|G) and n ev (e|G) over all the edges e = uv of a connected graph G, i.e., PI(G) = e∈E(G) [n eu (e|G) + n ev (e|G)], where n eu (e|G) is the number of edges of G lying closer to u than to v and n ev (e|G) is the number

Circular chromatic index of Cartesian pr
Circular chromatic index of Cartesian products of graphs
✍ Douglas B. West; Xuding Zhu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract The __circular chromatic index__ of a graph __G__, written $\chi\_{c}'(G)$, is the minimum __r__ permitting a function $f : E(G)\rightarrow [0,r)$ such that $1 \le | f(e)-f(e')|\le r - 1$ whenever __e__ and $e'$ are incident. Let $G = H$ β–‘ $C\_{2m +1}$, where β–‘ denotes Cartesian product

Game coloring the Cartesian product of g
Game coloring the Cartesian product of graphs
✍ Xuding Zhu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

## Abstract This article proves the following result: Let __G__ and __G__β€² be graphs of orders __n__ and __n__β€², respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__β€² degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__β€² has acyclic chromat