Biconditional cordial labeling of cycle related graphs

Let G = (V, E) be a graph. A function f: V → {0, 1} of the graph G is called a Biconditional cordial labeling of G if an induced edge function f*: E → {0, 1} defined by f*(uv)={ 1,iff(u)=f(v)0,iff(u)≠f(v) satisfies the following two conditions. i)|vf(0)−vf(1)|≤1ii)|ef*(0)−ef*(1)|≤1 In this manuscrip...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kalaimathi, M., Balamurugan, B. J.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Graph theory Graphs Labeling Sunflowers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!