Cycle-magic graphs

被引：74

作者：

Llado, A. ^{[1
]}

Moragas, J. ^{[1
]}

机构：

[1] Univ Politecn Cataluna, Dept Matemat Aplicada 4, E-08034 Barcelona, Spain

来源：

DISCRETE MATHEMATICS | 2007年 / 307卷 / 23期

关键词：

edge coverings; magic labelings;

D O I：

10.1016/j.disc.2007.03.007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A simple graph G = (V, E) admits a cycle-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle C. Then the graph G is C-magic if there exists a total labelling f : V boolean OR E -> {1, 2,..., vertical bar V vertical bar + vertical bar E vertical bar} such that, for every subgraph H'= (V', E') of G isomorphic to C, Sigma(v epsilon V') f (v) + Sigma(e epsilon E') f (e) is constant. When f (V) = {1,..., vertical bar V vertical bar}, then G is said to be C-supermagic. We study the cyclic-magic and cyclic-supermagic behavior of several classes of connected graphs. We give several families of C-r-magic graphs for each r >= 3. The results rely on a technique of partitioning sets of integers with special properties. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：2925 / 2933

页数：9