Regular sets in circulant graphs with degree 3

被引:0
|
作者
Hao, Yu-Xia [1 ]
Wang, Xiaomeng [2 ]
机构
[1] Northwest Normal Univ, Coll Math & Stat, Lanzhou 730070, Gansu, Peoples R China
[2] Lanzhou Univ, Sch Math & Stat, Lanzhou 730000, Gansu, Peoples R China
关键词
Regular set; Circulant graph; Perfect code; Total perfect code; EFFICIENT DOMINATING SETS; PERFECT CODES;
D O I
10.1016/j.dam.2024.05.033
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let Gamma = (V, E) be a graph and a, b nonnegative integers. An (a, b)-regular set in Gamma is a nonempty proper subset D of V such that every vertex in D has exactly a neighbours in D and every vertex in V \ D has exactly b neighbours in D. In this paper, we obtain a necessary and sufficient condition for the existence of (a, b)-regular sets in connected circulant graphs with degree 3, for all possible values a, b. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页码:51 / 55
页数:5
相关论文
共 50 条
  • [21] On regular sets in Cayley graphs
    Xiaomeng Wang
    Shou-Jun Xu
    Sanming Zhou
    Journal of Algebraic Combinatorics, 2024, 59 : 735 - 759
  • [22] DISTANCE DEGREE REGULAR GRAPHS
    HILANO, T
    NOMURA, K
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (01) : 96 - 100
  • [23] Regular character degree graphs
    Zuccari, Claudio Paolo Morresi
    JOURNAL OF ALGEBRA, 2014, 411 : 215 - 224
  • [24] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
    LIESP, Université Claude Bernard LyonI, 843, Bd. Du 11 Novembre 1918, 69622 Villeurbanne Cedex, France
    不详
    Discrete Math. Theor. Comput. Sci., 2008, 1 (57-70):
  • [25] Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
    Kheddouci, Hamamache
    Togni, Olivier
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, 10 (01): : 57 - 70
  • [26] The degree-diameter problem for circulant graphs of degree 8 and 9
    Lewis, Robert R.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (04):
  • [27] Open Locating-Dominating Sets in Circulant Graphs
    Givens, Robin
    Yu, Gexin
    Kincaid, Rex
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2022, 42 (01) : 47 - 62
  • [28] Some results on decompositions of low degree circulant graphs
    Bryant, Darryn
    Martin, Geoffrey
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 251 - 261
  • [29] Large circulant graphs of fixed diameter and arbitrary degree
    Bevan, David
    Erskine, Grahame
    Lewis, Robert
    ARS MATHEMATICA CONTEMPORANEA, 2017, 13 (02) : 275 - 291
  • [30] Large Independent Sets on Random d-Regular Graphs with Fixed Degree d
    Marino, Raffaele
    Kirkpatrick, Scott
    COMPUTATION, 2023, 11 (10)