Independent perfect dominating sets in semi-Cayley graphs (Q2661763)

From MaRDI portal
Revision as of 21:31, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Independent perfect dominating sets in semi-Cayley graphs
scientific article

    Statements

    Independent perfect dominating sets in semi-Cayley graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2021
    0 references
    Dominating sets play an important role in the design of computer networks. For any node, dominating sets can be used to decide the placement of limited resources. Cayley graphs and semi-Cayley graphs are two classes of important graphs in algebraic graph theory. The problem of dominating sets of Cayley graphs was investigated by several authors. In this paper, the authors consider the characterization of dominating sets in semi-Cayley graphs. Let \(\Gamma\) be a graph with \(V(\Gamma)\) and \(E(\Gamma)\) as vertex and edge sets, respectively. Let \(G\) be a finite group with a subset \(C\) and let \(A, B\) be subsets of \(G\) that are closed under taking inverses and do not contain the identity \(e.\) The Cayley graph Cay\((G, A)\) is the graph with vertex set \(G\) and two distinct vertices \(g\) and \(h\) are adjacent in Cay\((G, A)\) if and only if \(h^{-1} g \in A.\) It is to be observed that the Cayley graph Cay\((G, A)\) admits a subgroup of the automorphism of the Cayley graph acting regularly on \(V\) (Cay\((G, A)\)). If a graph \(\Gamma\) admits a subgroup of automorphisms acting semiregularly on \(V (\Gamma)\) with two orbits, then \(\Gamma\) is called a semi-Cayley graph. The semi-Cayley graph \(SC(G; A, B, C)\) is the graph with vertex set \(G \times \{0, 1\},\) two vertices \((g, i), (h, j)\) are adjacent if and only if one of the following three possibilities occurs: \par (1) \(i = j = 0\) ~and~ \(h^{-1} g \in A,\) \par (2) \(i = j = 1\) ~and~ \(h^{-1} g \in B,\) \par (3) \(i = 0, j = 1\) ~and~ \(h^{-1} g \in C.\) An independent perfect dominating set in a graph \(\Gamma\) with vertex set \(V (\Gamma)\) is a subset \(S\) of \(V (\Gamma)\) such that \(S\) is an independent set and every vertex in \(V (\Gamma)\setminus S\) is adjacent to exactly one vertex in \(S.\) In this paper, the authors provide a necessary and sufficient condition for the existence of independent perfect dominating sets in semi-Cayley graphs of finite groups. Also they obtain a necessary and sufficient condition for Cayley graphs to have independent perfect dominating sets on two classes non-abelian groups.
    0 references
    Cayley graph
    0 references
    semi-Cayley graph
    0 references
    independent perfect dominating set
    0 references
    non-abelian group
    0 references

    Identifiers