On C4-supermagic labelings of the Cartesian product of paths and graphs

被引:13
作者
Kojima, Toru [1 ]
机构
[1] Nihon Univ, Coll Humanities & Sci, Setagaya Ku, Tokyo 1568550, Japan
关键词
C-4-supermagic labeling; Super edge-magic labeling; Cartesian product;
D O I
10.1016/j.disc.2012.09.005
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. Suppose G admits an H-covering. A bijection f from V (G) UE (G) to {1, 2, . . . , vertical bar V (G)vertical bar + vertical bar E(G)vertical bar} is called an H-magic labeling of G if Sigma(v epsilon V(H')) f (v) + Sigma(e epsilon E(H')) f (e) is constant for every subgraph H' of G isomorphic to H. An H-magic labeling f of G is called an H-supermagic labeling of G if f (V (G)) = {1, 2, . . . , vertical bar V (G)vertical bar} In this paper, we investigate C-4-supermagic labelings of the Cartesian product of paths and graphs. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:164 / 173
页数:10
相关论文
共 10 条
[1]  
Enomoto H., 1998, SUT J MATH, V34, P105
[2]  
Figueroa-Centeno R.M., 2002, AUSTRALAS J COMBIN, V26, P199
[3]   The place of super edge-magic labelings among other classes of labelings [J].
Figueroa-Centeno, RM ;
Ichishima, R ;
Muntaner-Batle, FA .
DISCRETE MATHEMATICS, 2001, 231 (1-3) :153-168
[4]  
Gallian J. A., 2011, ELECTRON J COMB, V18, pDS6
[5]  
Gutierrez A., 2005, Journal of Combinatorial Mathematics and Combinatorial Computing, V55, P43
[6]   MAGIC VALUATIONS OF FINITE GRAPHS [J].
KOTZIG, A ;
ROSA, A .
CANADIAN MATHEMATICAL BULLETIN, 1970, 13 (04) :451-&
[7]  
Lee S.M., 2002, 16 MCCCC C
[8]   Cycle-magic graphs [J].
Llado, A. ;
Moragas, J. .
DISCRETE MATHEMATICS, 2007, 307 (23) :2925-2933
[9]  
Maryati T. K., 2008, Journal of Combinatorial Mathematics and Combinatorial Computing, V65, P197
[10]   H-supermagic labelings of graphs [J].
Ngurah, A. A. G. ;
Salman, A. N. M. ;
Susilowati, L. .
DISCRETE MATHEMATICS, 2010, 310 (08) :1293-1300