...
首页> 外文期刊>Journal of combinatorial mathematics and combinatorial computing >Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs
【24h】

Vertex-magic total labelings of union of generalized Petersen graphs and union of special circulant graphs

机译:广义Petersen图的并集和特殊循环图的并集的顶点魔术总标记

获取原文
获取原文并翻译 | 示例
           

摘要

Let G be a graph with vertex set V = V{G) and edge set E = E(G), and let n = |V(G)| and e = |E(G)|. A vertex-magic total labeling (VMTL) of a graph is defined as a one-to-one mapping taking the vertices and edges onto the set of integers {1, 2,..., n + e}, with the property that the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex. In this paper, we present the vertex magic total labeling of disjoint union of t generalized Petersen graphs ∪_(j=1)~tP{n_j,m_j), and disjoint union of t special circulant graphs ∪_(j=1)~t(1, m_j).
机译:令G为顶点集V = V {G)且边集E = E(G)的图,令n = | V(G)|。和e = | E(G)|。图的顶点魔术总标记(VMTL)定义为一对一的映射,将顶点和边带到一组整数{1,2,...,n + e}上,其属性为顶点上的标签和入射边缘上的标签的总和是一个常数,与顶点的选择无关。本文给出了t个广义Petersen图∪_(j = 1)〜tP {n_j,m_j)的不相交并的顶点魔术总标记,以及t个特殊循环图ant_(j = 1)〜的不相交并的顶点魔术总标记。 t(1,m_j)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号