首页> 外文期刊>AKCE International Journal of Graphs and Combinatorics >On 3 -total edge product cordial labeling of honeycomb
【24h】

On 3 -total edge product cordial labeling of honeycomb

机译: 3 -蜂窝的总边积亲切标签

获取原文
       

摘要

For a graph G = ( V ( G ) , E ( G ) ) , an edge labeling φ : E ( G ) → { 0 , 1 , … , k ? 1 } where k is an integer, 2 ≤ k ≤ | E ( G ) | , induces a vertex labeling φ ? : V ( G ) → { 0 , 1 , … , k ? 1 } defined by φ ? ( v ) = φ ( e 1 ) ? φ ( e 2 ) ? … ? φ ( e n ) ( mod k ) , where e 1 , e 2 , … , e n are the edges incident to the vertex v . The function φ is called a k -total edge product cordial labeling of G if | ( e φ ( i ) + v φ ? ( i ) ) ? ( e φ ( j ) + v φ ? ( j ) ) | ≤ 1 for every i , j , 0 ≤ i j ≤ k ? 1 , where e φ ( i ) and v φ ? ( i ) are the number of edges e and vertices v with φ ( e ) = i and φ ? ( v ) = i , respectively. In this paper, we investigate the existence of 3 -total edge product cordial labeling of hexagonal grid.
机译:对于图G =(V(G),E(G)),边标记为:E(G)→{0,1,…,k? 1},其中k是整数,2≤k≤| E(G)| ,诱导顶点标记φ? :V(G)→{0,1,…,k? 1}由? (v)=φ(e 1)? φ(e 2)? ……? φ(e n)(mod k),其中e 1,e 2,…,e n是入射到顶点v的边。如果|,则将函数φ称为G的k个总边乘积亲切标记。 (eφ(i)+ vφ?(i))? (eφ(j)+ vφ?(j))|每个i,j≤1,0≤i

著录项

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号