Root cube mean cordial labeling of K1,n × Pm

All the graphs considered in this article are simple and undirected. Let G = (V(G), E(G)) be a simple undirected Graph. A function f : V(G) → {0, 1, 2} is called root cube mean cordial labeling if the induced function f* : E(G) → {0, 1, 2} defined by f*(uv)=⌊ (f(u))3+(f(v))32 ⌋ satisfies the conditi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Parejiya, Jaydeep, Mundadiya, Sneha, Gandhi, Harsh, Solanki, Ramesh, Jariya, Mahesh
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Apexes Graph theory Labeling Labelling Labels
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!