سند علمی

Bounds for Domination Parameters in Cayley Graphs on Dihedral Group

چکیده

In this paper, sharp upper bounds for the domination number, total domination number and connected domination number for the Cayley graph G = Cay(D2n, Ω) constructed on the finite dihedral group D2n, and a specified generating set Ω of D2n. Further efficient dominating sets in G = Cay(D2n, Ω) are also obtained. More specifically, it is proved that some of the proper subgroups of D2n are efficient domination sets. Using this, an E-chain of Cayley graphs on the dihedral group is also constructed.

اسناد مشابه

  • On trivial ends of Cayley graph of groups

    مقاله۲۰۱۹پژوهش های نوین در ریاضی (علوم پایه سابق)A. Babaee, H. Mirebrahimi

    ‎ In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayle

  • Critical percolation on Cayley graphs of groups acting on trees

    سند علمی۲۰۰۸Iva Kozáková

    This article presents a method for finding the critical probability pc for the Bernoulli bond percolation on graphs with the so called tree-like structure. Such graphs can be decomposed into a tree of pieces which have finitely many isomorphism classes. This class of graphs inclu

  • Efficient domination in Cayley graphs of generalized dihedral groups

    مقاله‌ی دسترسی آزاد۲۰۲۰Discussiones Mathematicae Graph TheoryCaferCaliskan, StefkoMiklavic, SibelÖzkan, PrimožŠparl
  • New Binary Constant Weight Codes Based on Cayley Graphs of Groups and Their Decoding Methods

    سند علمی۲۰۰۵IEICE TransactionsJun Imai, Yoshinao Shiraki

    We propose a new class of binary nonlinear codes of constant weights derived from a permutation representation of a group that is given by a combinatorial definition such as Cayley graphs of a group. These codes are constructed by the following direct interpretation method from a

  • On the unitary Cayley graphs of group rings

    مقاله۲۰۲۶Journal of Algebra and Related TopicsK. Limkul, S. Nanta

    Let $R$ be a ring. The unitary Cayley graph of a ring $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R$ where two vertices $u,v\in R$ are adjacent if and only if $u-v$ is a unit of $R$. In this paper, we investigate the unitary Cayley graph of a finite ring, called a gr

  • On transitive Cayley graphs of groups and semigroups

    سند علمی۲۰۰۳Eur. J. Comb.Andrei V. Kelarev, Cheryl E. Praeger

    We investigate Cayley graphs of semigroups and show that they sometimes enjoy properties analogous to those of the Cayley graphs of groups. c © 2003 Elsevier Science Ltd. All rights reserved.