CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE

被引：2
|
作者：
Irawan, Agus [1 ,2 ]
Asmiati [3 ]
Suharsono, S. [3 ]
Muludi, Kurnia [4 ]
Zakaria, La [3 ]
机构：
[1] Lampung Univ, Fac Math & Nat Sci, Jl Sumantri Brodjonegoro 1, Bandar Lampung, Indonesia
[2] STMIK Pringsewu, Informat Syst, Jl Wisma Rini 09, Pringsewu, Lampung, Indonesia
[3] Lampung Univ, Fac Math & Nat Sci, Dept Math, Jl Sumantri Brodjonegoro 1, Bandar Lampung, Indonesia
[4] Lampung Univ, Fac Math & Nat Sci, Comp Sci, Jl Sumantri Brodjonegoro 1, Bandar Lampung, Indonesia
来源：
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2020年 / 24卷 / 02期
关键词：
coloring; generalized Petersen graph; locating-chromatic number;
D O I：
10.17654/DM024020083
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The locating-chromatic number of a graph is combined two graph concept, coloring vertices and partition dimension of a graph. The locating-chromatic number, denoted by chi(L)(G), is the smallest k such that G has a locating k-coloring. In this paper, we discuss the locating-chromatic number for certain operation of generalized Petersen graphs sP(n, 1).
引用
收藏
页码：83 / 97
页数：15
相关论文
共 50 条
  • [41] Radio Number for Generalized Petersen Graphs P(n,2)
    Zhang F.
    Nazeer S.
    Habib M.
    Zia T.J.
    Ren Z.
    IEEE Access, 2019, 7 : 142000 - 142008
  • [42] On the [1,2]-domination number of generalized Petersen graphs
    Chen, Lily
    Ma, Yingbin
    Shi, Yongtang
    Zhao, Yan
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 327 : 1 - 7
  • [43] On the domination number of generalized Petersen graphs P(n,3)
    Fu Xueliang
    Yang Yuansheng
    Jiang Baoqi
    ARS COMBINATORIA, 2007, 84 : 373 - 383
  • [44] Roman domination number of Generalized Petersen Graphs P(n, 2)
    Wang, Haoli
    Xu, Xirong
    Yang, Yuansheng
    Ji, Chunnian
    ARS COMBINATORIA, 2013, 112 : 479 - 492
  • [45] Paired domination number of generalized Petersen graphs P(n, 2)
    Li, Wensheng
    Xing, Huaming
    Huang, Zhongsheng
    ARS COMBINATORIA, 2017, 133 : 147 - 154
  • [46] Improved Upper Bound for Generalized Acyclic Chromatic Number of Graphs
    Cai, Jian-sheng
    Zhu, Xu-ding
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2018, 34 (04): : 798 - 800
  • [47] The generalized acyclic edge chromatic number of random regular graphs
    Gerke, Stefanie
    Greenhill, Catherine
    Wormald, Nicholas
    JOURNAL OF GRAPH THEORY, 2006, 53 (02) : 101 - 125
  • [48] Improved Upper Bound for Generalized Acyclic Chromatic Number of Graphs
    Jian-sheng Cai
    Xu-ding Zhu
    Acta Mathematicae Applicatae Sinica, English Series, 2018, 34 : 798 - 800
  • [49] Improved Upper Bound for Generalized Acyclic Chromatic Number of Graphs
    Jian-sheng CAI
    Xu-ding ZHU
    ActaMathematicaeApplicataeSinica, 2018, 34 (04) : 798 - 800
  • [50] Locating-Coloring on Halin Graphs with a Certain Number of Inner Faces
    Purwasih, I. A.
    Baskoro, E. T.
    Assiyatun, H.
    Suprijanto, D.
    PROCEEDINGS OF THE 7TH SEAMS UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2015: ENHANCING THE ROLE OF MATHEMATICS IN INTERDISCIPLINARY RESEARCH, 2016, 1707
12345