Generalized Cayley graphs over polygroups

被引：7
作者：
Heidari, Dariush [1 ]
Amooshahi, Marzieh [2 ]
Davvaz, Bijan [3 ]
机构：
[1] Mahallat Inst Higher Educ, Fac Sci, Mahallat, Iran
[2] Islamic Azad Univ, Young Researcher & Elite Club, Khomein Branch, Khomein, Iran
[3] Yazd Univ, Dept Math, Yazd, Iran
来源：
COMMUNICATIONS IN ALGEBRA | 2019年 / 47卷 / 05期
关键词：
Caylay graph; GCP-graph; group; polygroup; simple graph; COMBINATORIAL ASPECTS;
D O I：
10.1080/00927872.2018.1530254
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Polygroups are a generalization of groups in which the composition of any two elements are a non-empty set. In this paper, first we recall the concept of polygroups and introduce a new construction for building a polygroup from a polygroup and a non-empty set. Then we study the concept of generalized Cayley graphs over polygroups, say GCP-graphs. Then we prove some properties of them in order to answer this question: which simple graphs are GCP-graphs? Finally, we prove that every simple graph of order at most five is a GCP-graph.
引用
收藏
页码：2209 / 2219
页数：11
相关论文
共 35 条
  • [1] SOLVABLE POLYGROUPS AND DERIVED SUBPOLYGROUPS
    Aghabozorgi, H.
    Davvaz, B.
    Jafarpour, M.
    [J]. COMMUNICATIONS IN ALGEBRA, 2013, 41 (08) : 3098 - 3107
  • [2] Ameri R, 2017, ITAL J PURE APPL MAT, P595
  • [3] [Anonymous], 2003, Advances in Mathematics
  • [4] [Anonymous], 2007, Graph Theory
  • [5] Combinatorial aspects of n-ary polygroups and n-ary color schemes
    Anvariyeh, S. M.
    Mirvakili, S.
    Davvaz, B.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (02) : 207 - 216
  • [6] Bonansinga P., 1982, BUMI B, V2, P717
  • [7] Burcroff A, 1809, ARXIV04769
  • [8] Cayley A., 1878, Proc. London Math. Soc., V9, P126, DOI 10.1112/plms/s1-9.1.126
  • [9] Comer S. D, 1996, HYPERSTRUCTURES ASS, P49
  • [10] COMBINATORIAL ASPECTS OF RELATIONS
    COMER, SD
    [J]. ALGEBRA UNIVERSALIS, 1984, 18 (01) : 77 - 94
1234