We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Mean Cordial Labelling of Some Star-Related Graphs.
- Authors
Deshmukh, Ujwala; Shaikh, Vahida Y.
- Abstract
Let f be a map from V (G) to {0, 1, 2}. For each edge uv assign the label f*(uv) = lf(u)+f(v)/ 2 m. f is called as a mean cordial labelling if ∣vf (i) - vf (j)∣ 6 1 and ∣e* f (i) - e* f (j)∣ 6 1, i, j ∊ {0, 1, 2}, where vf (x) and e* f (x) denote the number of vertices and edges respectively labelled with x (x = 0, 1, 2). A graph with mean cordial labelling is called mean cordial. In this paper we prove the graph hK1,n : 2i and path union of n copies of star K1,m are mean cordial graphs.
- Subjects
STAR graphs (Graph theory); GRAPH labelings; GEOMETRIC vertices; INTEGERS; SMARANDACHE notions
- Publication
International Journal of Mathematical Combinatorics, 2016, Vol 3, p146
- ISSN
1937-1055
- Publication type
Article