Perfect 2-coloring of the quartic graphs with order at most 8

被引:0
作者
Golzadeh, Yazdan [1 ]
Alaeiyan, Mehdi [2 ]
Gilani, Alireza [1 ]
机构
[1] Islamic Azad Univ, South Tehran Branch, Dept Math, Tehran, Iran
[2] Iran Univ Sci & Technol, Dept Math, Tehran 16844, Iran
关键词
Perfect coloring; Equitable partition; Quartic graph; Perfect code; Regular graph;
D O I
10.1007/s40096-019-00294-9
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we study perfect 2-coloring of the quartic graphs with at most 8 vertices. The problem of the existence of perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.
引用
收藏
页码:249 / 254
页数:6
相关论文
共 9 条
  • [1] On perfect codes and related concepts
    Ahlswede, R
    Aydinian, HK
    Khachatrian, LH
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2001, 22 (03) : 221 - 237
  • [2] Perfect 2-colorings of the generalized Petersen graph
    Alaeiyan, Mehdi
    Karami, Hamed
    [J]. PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 2016, 126 (03): : 289 - 294
  • [3] Avgustinovich S V, 2011, J APPL IND MATH, V5, P19
  • [4] Avgustinovich S, 2008, LECT NOTES COMPUT SC, V5228, P11, DOI 10.1007/978-3-540-87448-5_2
  • [5] Perfect 2-colorings of a hypercube
    Fon-Der-Flaass, D. G.
    [J]. SIBERIAN MATHEMATICAL JOURNAL, 2007, 48 (04) : 740 - 745
  • [6] Gavilyuk A.L., 2013, J COMB DES, V21, P232
  • [7] Compact graphs and equitable partitions
    Godsil, CD
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1997, 255 : 259 - 266
  • [8] [Могильных Иван Юрьевич Mogil'nykh I.Yu.], 2007, [Проблемы передачи информации, Problemy peredachi informatsii], V43, P37
  • [9] Ronald C.R., 1998, ATLAS GRAPHS