Full friendly index sets of P2 × Pn

Wai Chee SHIU*, Harris Kwong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

Abstract

Let G = (V, E) be a graph, a vertex labeling f : V → Z2 induces an edge labeling f* : E → Z2 defined by f* (xy) = f (x) + f (y) for each xy ∈ E. For each i ∈ Z2, 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.

Original languageEnglish
Pages (from-to)3688-3693
Number of pages6
JournalDiscrete Mathematics
Volume308
Issue number16
DOIs
Publication statusPublished - 28 Aug 2008

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

User-Defined Keywords

  • Friendly index
  • Grid

Fingerprint

Dive into the research topics of 'Full friendly index sets of P<sub>2</sub> × P<sub>n</sub>'. Together they form a unique fingerprint.

Cite this