ON FINITE PRIME DISTANCE GRAPHS

被引：2
|
作者：
Parthiban, A. [1 ]
Samdanielthompson, G. [2 ]
Kumar, K. Sathish [3 ]
机构：
[1] Lovely Profess Univ, Dept Math, Jalandhar 144411, Punjab, India
[2] Hindustan Coll Arts & Sci, Dept Math, Chennai 603103, Tamil Nadu, India
[3] Madras Christian Coll, Dept Math, Chennai 600059, Tamil Nadu, India
来源：
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS | 2021年 / 52卷 / 01期
关键词：
Distance Graphs; Prime Distance Graphs; Prime Distance Labeling; Finite Prime Distance Graphs;
D O I：
10.1007/s13226-021-00135-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph G is a prime distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is a prime number. It is known that cycles and bipartite graphs are prime distance graphs. In this paper we derive some general results concerning prime distance labeling of graphs and also establish interesting results for complete graphs, wheel graphs, and wheel-related graphs.
引用
收藏
页码：22 / 26
页数：5
相关论文
共 50 条
  • [31] NEW RESULTS ON 3-CHROMATIC PRIME DISTANCE GRAPHS
    EGGLETON, RB
    ARS COMBINATORIA, 1988, 26B : 153 - 180
  • [32] Universality for the Distance in Finite Variance Random Graphs
    Henri van den Esker
    Remco van der Hofstad
    Gerard Hooghiemstra
    Journal of Statistical Physics, 2008, 133 : 169 - 202
  • [33] On finite 2-distance-primitive graphs
    Ruan, Jie
    Liu, Weijun
    Jin, Wei
    DISCRETE MATHEMATICS, 2024, 347 (07)
  • [34] Finite 2-Distance Transitive Graphs
    Corr, Brian P.
    Jin, Wei
    Schneider, Csaba
    JOURNAL OF GRAPH THEORY, 2017, 86 (01) : 78 - 91
  • [35] Finite primitive distance-transitive graphs
    van Bon, John
    EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (02) : 517 - 532
  • [36] Universality for the distance in finite variance random graphs
    van den Esker, Henri
    van der Hofstad, Remco
    Hooghiemstra, Gerard
    JOURNAL OF STATISTICAL PHYSICS, 2008, 133 (01) : 169 - 202
  • [37] INFINITE DISTANCE TRANSITIVE GRAPHS OF FINITE VALENCY
    MACPHERSON, HD
    COMBINATORICA, 1982, 2 (01) : 63 - 69
  • [38] Embeddability of finite distance graphs with a large chromatic number in random graphs
    S. V. Nagaeva
    Doklady Mathematics, 2008, 77 : 13 - 16
  • [39] Embeddability of finite distance graphs with a large chromatic number in random graphs
    Nagaeva, S. V.
    DOKLADY MATHEMATICS, 2008, 77 (01) : 13 - 16
  • [40] On embedding of finite distance graphs with large chromatic number in random graphs
    Nagaeva S.V.
    Raigorodskii A.M.
    Journal of Mathematical Sciences, 2009, 161 (5) : 648 - 667
12345