학술논문
3-product cordial labeling of some snake graphs.
Document Type
Article
Author
Source
Subject
*GRAPH labelings
*GEOMETRIC vertices
*EDGES (Geometry)
*MATHEMATICAL mappings
*GRAPH theory
*
*
*
*
Language
ISSN
0716-0917
Abstract
Let G be a (p,q) graph. A mapping f: V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) - vf(j)| ≤ 1 and |ef (i) - ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod3). A graph with 3-product cordial labeling is called 3-product cordial graph. In this paper we investigate the 3-product cordial behavior of alternate triangular snake, double alternate triangular snake and triangular snake graphs. [ABSTRACT FROM AUTHOR]