Hits:

Indexed by:期刊论文

Date of Publication:2012-07-01

Journal:ARS COMBINATORIA

Included Journals:SCIE、Scopus

Volume:105

Page Number:45-52

ISSN No.:0381-7032

Key Words:Flower Snark; Prime labeling; Prime cordial; Prime cordial labeling

Abstract:A graph with vertex set V is said to have a prime cordial labeling if there is a bijection f from V to {1, 2, ..., vertical bar V vertical bar} such that if each edge uv is assigned the label 1 for the greatest common divisor gcd(f(u), f(v)) = 1 and 0 for gcd(f(u), f (v)) > 1 then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we show that the Flower Snark and its related graphs are prime cordial for all n >= 3.