Full friendly index sets of Cartesian products of two cycles

Wai Chee SHIU, Man Ho Alpha LING

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Let G = (V,E) be a connected simple graph. A labeling f: V → ℤ₂ induces an edge labeling f*: E → ℤ₂ defined by f*(xy) = f(x)+ f(y) for each xyE. For i ∈ ℤ₂, let υ f (i) = |f ⁻¹ (i)| and e f (i) = |f*⁻¹ (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. Copyright © 2010 Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg
Original languageEnglish
Pages (from-to)1233-1244
JournalActa Mathematica Sinica, English Series
Volume26
Issue number7
DOIs
Publication statusPublished - Jul 2010

Citation

Shiu, W. C., & Ling, M. H. (2010). Full friendly index sets of Cartesian products of two cycles. Acta Mathematica Sinica-English Series, 26(7), 1233-1244. doi: 10.1007/s10114-010-8517-5

Keywords

  • Vertex labeling
  • Friendly labeling
  • Friendly index set
  • Cartesian product of two cycles

Fingerprint Dive into the research topics of 'Full friendly index sets of Cartesian products of two cycles'. Together they form a unique fingerprint.