Full friendly index sets of P2×Pn
- 作者：Wai Chee Shiu ; Harris Kwong
- 关键词：Friendly index ; Grid
- 刊名：Discrete Mathematics
- 出版年：2008
- 期刊代码：47_0012365x
- 类别：cp
- 出版时间：28 August 2008
- 卷：308
- 期：16
- 页码：3688-3693
- 文件大小：161 K
摘要
Let G=(V,E) be a graph, a vertex labeling 
induces an edge labeling 
defined by 16034b4b50fa4a1e89d52f" title="Click to view the MathML source" alt="Click to view the MathML source">f*(xy)=f(x)+f(y) for each xy
E. For each 
, define vf(i)=|f-1(i)| and ef(i)=|f*-1(i)|. We call f friendly if |vf(1)-vf(0)|
1. The full friendly index set of G is the set of all possible values of ef(1)-ef(0), where f is friendly. In this note, we study the full friendly index set of the grid graph P2×Pn.
E. For each 1. The full friendly index set of G is the set of all possible values of ef(1)-ef(0), where f is friendly. In this note, we study the full friendly index set of the grid graph P2×Pn.