Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Between the enhanced power graph and the commuting graph
    Cameron, Peter J., 1947- ; Kuzma, Bojan, 1968-
    The purpose of this note is to define a graph whose vertex set is a finite group ▫$G$▫, whose edge set is contained in that of the commuting graph of ▫$G$▫ and contains the enhanced power graph of ... ▫$G$▫. We call this graph the deep commuting graph of ▫$G$▫. Two elements of ▫$G$▫ are joined in the deep commuting graph if and only if their inverse images in every central extension of ▫$G$▫ commute. We give conditions for the graph to be equal to either of the enhanced power graph and the commuting graph, and show that automorphisms of ▫$G$▫ act as automorphisms of the deep commuting graph.
    Source: Journal of graph theory. - ISSN 0364-9024 (Vol. 102, iss. 2, Feb. 2023, str. 295-303)
    Type of material - article, component part ; adult, serious
    Publish date - 2023
    Language - english
    COBISS.SI-ID - 151079683

source: Journal of graph theory. - ISSN 0364-9024 (Vol. 102, iss. 2, Feb. 2023, str. 295-303)
loading ...
loading ...
loading ...