Determining the edge metric dimension of the generalized Petersen graph P(n, 3)

被引:3
|
作者
Wang, David G. L. [1 ,2 ,3 ]
Wang, Monica M. Y. [1 ]
Zhang, Shiqiang [4 ]
机构
[1] Beijing Inst Technol, Sch Math & Stat, Beijing 102400, Peoples R China
[2] Beijing Inst Technol, Beijing Key Lab MCAACI, Beijing 102400, Peoples R China
[3] Minist Ind & Informat Technol, Key Lab Math Theory & Computat Informat Secur, Beijing 102400, Peoples R China
[4] Imperial Coll London, Dept Comp, London SW7 2AZ, England
基金
中国国家自然科学基金;
关键词
Generalized Petersen graph; Metric dimension; Resolving set; Floyd-Warshall algorithm; HAMILTONIAN CYCLES; 2-RAINBOW DOMINATION; CROSSING NUMBER;
D O I
10.1007/s10878-021-00780-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph P(n, k) is at least 3. We prove that the graph P(n, 3) has edge dimension 4 for n >= 11, by showing semi-combinatorially the nonexistence of an edge resolving set of order 3 and by constructing explicitly an edge resolving set of order 4.
引用
收藏
页码:460 / 496
页数:37
相关论文
共 50 条
  • [41] On the Crossing Number of the Generalized Petersen Graph P(3k, k)
    Wang Jing
    Yuan Zihan
    Huang Yuanqiu
    ARS COMBINATORIA, 2011, 100 : 395 - 407
  • [42] ASYMPTOTIC BEHAVIOR OF THE EDGE METRIC DIMENSION OF THE RANDOM GRAPH
    Zublirina, Nina
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (02) : 589 - 599
  • [43] Uniquely identifying the edges of a graph: The edge metric dimension
    Kelenc, Aleksander
    Tratnik, Niko
    Yero, Ismael G.
    DISCRETE APPLIED MATHEMATICS, 2018, 251 : 204 - 220
  • [44] Perfect 2-colorings of the generalized Petersen graph GP(n, 3)
    Karami, Hamed
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2022, 10 (01) : 239 - 245
  • [45] The crossing number of the generalized Petersen graph P(10,3) is six
    Yang, Yuansheng
    Zheng, Baigong
    Xu, Xirong
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (07) : 1373 - 1380
  • [46] Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph
    Guirao, Juan L. G.
    Ahmad, Sarfraz
    Siddiqui, Muhammad Kamran
    Ibrahim, Muhammad
    MATHEMATICS, 2018, 6 (12):
  • [47] Computing 3-total edge product cordial labeling of generalized Petersen graphs P(n, m)
    Ahmad, Ali
    ARS COMBINATORIA, 2018, 137 : 263 - 271
  • [48] On (a,d)-antimagic labelings of generalized Petersen graphs P(n,3)
    Xu Xirong
    Yang Yuansheng
    Xi Yue
    Li Huijun
    ARS COMBINATORIA, 2008, 86 : 23 - 31
  • [49] The comparative analysis of metric and edge metric dimension of some subdivisions of the wheel graph
    Raza, Zahid
    Bataineh, M. S.
    ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2021, 14 (04)
  • [50] The Italian Domination Numbers of Generalized Petersen Graphs P(n,3)
    Gao, Hong
    Xi, Changqing
    Li, Kun
    Zhang, Qingfang
    Yang, Yuansheng
    MATHEMATICS, 2019, 7 (08)