Distance magic labelings of a union of graphs

被引：0

作者：

Shafiq, Muhammad Kashif ^{[1
]}

Ali, Gohar ^{[1
]}

Simanjuntak, Rinovia ^{[2
]}

机构：

[1] Govt Coll Univ, Abdus Salam Sch Math Sci, 68-B,New Muslim Town, Lahore, Pakistan

[2] ITB, Fac Math & Nat Sci, Combinatorial Math Res Div, Bandung, Indonesia

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2009年 / 6卷 / 01期

关键词：

distance magic labeling; 1-vertex-magic vertex labeling; union of graphs;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A 1-vertex-magic vertex labeling of a graph G(V, E) with p vertices is a bijection f from the vertex set V (G) to the integers 1, 2,..., p with the property that there is a constant k such that at any vertex x the sum Sigma f(x) taken over all neighbors of x is k. In this paper, we study the 1-vertex-magic vertex labelings of two families of disconnected graphs, namely a disjoint union of m copies of complete p-partite graph and a disjoint union of m copies of 2n-regular graph Cp[K-n].

引用

页码：191 / 200

页数：10