THE STRONG SEQUENTIAL NUMBER OF GRAPHS

被引：0
|
作者：
Ichishima, R. [1 ]
Muntaner-Batle, F. A. [2 ]
Oshima, A. [2 ]
机构：
[1] Kokushikan Univ, Dept Sport & Phys Educ, Fac Phys Educ, 7-3-1 Nagayama, Tokyo 2068515, Japan
[2] Univ Newcastle, Graph Theory & Applicat Res Grp, Sch Elect Engn & Comp Sci, Fac Engn & Built Environm, Callaghan, NSW 2308, Australia
来源：
UTILITAS MATHEMATICA | 2020年 / 116卷
关键词：
sequential labeling; (consecutively) super edge-magic labeling; alpha-valuation; harmonious labeling; felicitous labeling; (strong) sequential number; (consecutively) super edge-magic deficiency; alpha-number;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we introduce the notion of strong sequential number, and provide a necessary condition for a graph to have finite strong sequential number as well as sufficient conditions for a graph to have infinite strong sequential number. We also exhibit the connections between the strong sequential number and other parameters that have previously been studied in the area of graph labelings. In addition, we present some results involving joins of graphs.
引用
收藏
页码：247 / 259
页数：13
相关论文
共 50 条
  • [1] On the strong chromatic number of graphs
    Axenovich, Maria
    Martin, Ryan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (03) : 741 - 747
  • [2] THE STRONG FRACTIONAL CHOICE NUMBER AND THE STRONG FRACTIONAL PAINT NUMBER OF GRAPHS*
    Xu, Rongxing
    Zhu, Xuding
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (04) : 2585 - 2601
  • [3] Strong Upper Geodetic Number of Graphs
    Infanta, L. G. Bino
    Xavier, D. Antony
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2021, 12 (03): : 737 - 748
  • [4] Strong Geodetic Number of Graphs and Connectivity
    Wang, Zhao
    Mao, Yaping
    Ge, Huifen
    Magnant, Colton
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (03) : 2443 - 2453
  • [5] Toll number of the strong product of graphs
    Gologranc, Tanja
    Repolusk, Polona
    DISCRETE MATHEMATICS, 2019, 342 (03) : 807 - 814
  • [6] Strong matching preclusion number of graphs
    Mao, Yaping
    Wang, Zhao
    Cheng, Eddie
    Melekian, Christopher
    THEORETICAL COMPUTER SCIENCE, 2018, 713 : 11 - 20
  • [7] Strong Geodetic Number of Graphs and Connectivity
    Zhao Wang
    Yaping Mao
    Huifen Ge
    Colton Magnant
    Bulletin of the Malaysian Mathematical Sciences Society, 2020, 43 : 2443 - 2453
  • [8] On the strong Roman domination number of graphs
    Alvarez-Ruiz, M. P.
    Mediavilla-Gradolph, T.
    Sheikholeslami, S. M.
    Valenzuela-Tripodoro, J. C.
    Yero, I. G.
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 44 - 59
  • [9] The Menger number of the strong product of graphs
    Abajo, E.
    Casablanca, R. M.
    Dianez, A.
    Garcia-Vazquez, P.
    DISCRETE MATHEMATICS, 2013, 313 (13) : 1490 - 1495
  • [10] On the strong chromatic number of random graphs
    Loh, Po-Shen
    Sudakov, Benny
    COMBINATORICS PROBABILITY & COMPUTING, 2008, 17 (02): : 271 - 286
12345