Distance Magic Labeling in Complete 4-partite Graphs

被引:0
作者
Daniel Kotlar
机构
[1] Tel-Hai College,Department of Computer Science
来源
Graphs and Combinatorics | 2016年 / 32卷
关键词
Distance magic labeling; Equitable partition;
D O I
暂无
中图分类号
学科分类号
摘要
Let G be a complete k-partite simple undirected graph with parts of sizes p1≤p2⋯≤pk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p_1\le p_2\cdots \le p_k$$\end{document}. Let Pj=∑i=1jpi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_j=\sum _{i=1}^jp_i$$\end{document} for j=1,…,k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j=1,\ldots ,k$$\end{document}. It is conjectured that G has distance magic labeling if and only if ∑i=1Pj(n-i+1)≥jn+12/k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum _{i=1}^{P_j} (n-i+1)\ge j{{n+1}\atopwithdelims (){2}}/k$$\end{document} for all j=1,…,k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$j=1,\ldots ,k$$\end{document}. The conjecture is proved for k=4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=4$$\end{document}, extending earlier results for k=2,3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=2,3$$\end{document}.
引用
收藏
页码:1027 / 1038
页数:11
相关论文
共 9 条
  • [1] Anholcer M(2014)Distance magic labeling and two products of graphs Graphs Comb. 31 1-12
  • [2] Cichacz S(2009)On Discrete Math. 309 1783-1787
  • [3] Peterin I(2009) and Electron. J. Comb. 16 1-219
  • [4] Tepeh A(2003) labelled graphs Aust. J. Comb. 28 305-315
  • [5] Beena S(undefined)A dynamic survey of graph labeling undefined undefined undefined-undefined
  • [6] Gallian JA(undefined)Distance magic labelings of graphs undefined undefined undefined-undefined
  • [7] Miller M(undefined)undefined undefined undefined undefined-undefined
  • [8] Rodger C(undefined)undefined undefined undefined undefined-undefined
  • [9] Simanjuntak R(undefined)undefined undefined undefined undefined-undefined