Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A totally magic cordial labeling of one-point union of n copies of a graph

Jeyanthi P., Angel-Benseera N.

Opuscula Mathematica

2014

Vol. 34, no. 1

115--122

A graph G is said to have a totally magic cordial (TMC) labeling with constant C if there exists a mapping ƒ : V (G) ∪ E(G) → {0, 1} such that ƒ(a)+ ƒ (b)+ ƒ(ab) ≡ C(mod 2) for all ab ∈ E(G) and [formula], where nƒ(i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we establish the totally magic cordial labeling of one-point union of n-copies of cycles, complete graphs and wheels.