Full friendly index sets of Cartesian products of two cycles |
| |
Authors: | Wai Chee Shiu Man Ho Ling |
| |
Institution: | 1. Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, P. R. China
|
| |
Abstract: | Let G = (V,E) be a connected simple graph. A labeling f: V → ℤ2 induces an edge labeling f*: E → ℤ2 defined by f*(xy) = f(x)+ f(y) for each xy ∈ E. For i ∈ ℤ2, let υ
f
(i) = |f
−1(i)| and e
f
(i) = |f*−1(i)|. A labeling f is called friendly if |υ
f
(1) − υ
f
(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by i
f
(G) = e
f
(1) − e
f
(0). The set {i
f
(G) | f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI(G). In this paper, we will determine the full friendly index set of every Cartesian product of two cycles. |
| |
Keywords: | vertex labeling friendly labeling friendly index set Cartesian product of two cycles |
本文献已被 维普 SpringerLink 等数据库收录! |
|