Let G be a graph. Let f: V(G) → {0,1,2,...,k ? 1} be a map where k ∈ N and k 1. For each edge uv, assign the label f(u)?f(v) . f is called k-total difference cordial labeling of G if tdf(i)?tdf(j) ≤ 1, i, j ∈{0,1,2,...,k?1} where tdf(x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of corona of snake graphs with K1.
展开▼
机译：设g是一个图表。让F：v（g）→{0,1,2，...，k？ 1}是k∈n和k> 1.对于每个边缘UV，分配标签F（u）？f（v）。 f称为k-总差异的g如果tdf（i）？tdf（j）≤1，i，j∈{0,1,2，...，k≤1}其中tdf（x）表示顶点总数和标有x的边缘。具有承认K-Total Doly DateCial标记的图表称为K-Total Doluty Catrial图形。在本文中，我们研究了蛇形图的4-总差异康复标记行为与K1。
展开▼
