Normal 0 false false false EN-US X-NONE X-NONE Let G be a graph with p vertices and q edges and let A = {0, 1, 2,..., }. A vertex labeling f : V ( G ) ? A induces an edge labeling f * defined by f * ( uv ) = f ( u ) + f ( v ) for all edges uv . For , let v f ( a ) be the number of vertices v with f(v) = a . A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A , and the induced edge labels are 1, 2, 3,…, q . In this paper, we establish vertex equitable labeling of square graph of and splitting graph of and kC 4 –snake( k ≥1) and the generalized k C n –snake is vertex equitable if n o 0(mod4), n ≥4.
展开▼
机译：正常0错误错误false EN-US X-NONE X-NONE令G为具有p个顶点和q个边的图，令A = {0，1，2，...，}。标记为f：V（G）的顶点？ A诱导所有边缘uv的边缘标记f *由f *（uv）= f（u）+ f（v）定义。对于，令v f（a）为顶点v的数目，其中f（v）= a。如果存在一个顶点标记f，使得对于A中的所有a和b，并且诱导边缘标记为1，2，3，…，q，则图G被认为是顶点相等的。在本文中，我们建立了kC 4 -snake（k≥1）的正方形图和分裂图的顶点等效标记，如果n o 0（mod4），n≥4，则广义k C n -snake是顶点等效的。
展开▼
