2019

Domination parameters on Cayley digraphs of transformation semigroups with fixed sets

For a nonempty subset Y of a nonempty set X , denote by F ix(X, Y ) the semigroup of full transformations on the set X in which all elements in Y are fixed. The Cayley digraph Cay(F ix(X, Y ), A) of F ix(X, Y ) with respect to a connection set A ⊆ F ix(X, Y ) is defined as a digraph whose vertex set is F ix(X, Y ) and two vertices α, β are adjacent in sense of drawing a directed edge (arc) from α to β if there exists µ ∈ A such that β = αµ. In this paper, we determine domination parameters of Cay(F ix(X, Y ), A) where A is a subset of F ix(X, Y ) related to minimal idempotents and permutations in F ix(X, Y ).

PDF

___

[1] Amooshahi M, Taeri B. On the domination and total domination numbers of Cayley sum graphs over Zn . Kragujevac Journal of Mathematics 2014; 38 (2): 315-320.
[2] Anupama SB, Maralabhavi YB, Goudar VM. Connected domination number of a jump graph. Journal of Computer and Mathematical Sciences 2015; 6 (10): 538-545.
[3] Arumugam S, Jacob K, Volkmann L. Total and connected domination in digraphs. Australasian Journal of Combinatorics 2007; 39: 283-292.
[4] Blidia M, Ould-Rabah L. Bounds on the domination number in oriented graphs. Australasian Journal of Combinatorics 2010; 48: 231-241.
[5] Cayley A. The theory of groups: graphical representation. American Journal of Mathematics 1878; 1 (2): 174-176.
[6] Chaluvaraju B, Appajigowda C. The split domination number of a prism graph. Advances and Applications in Discrete Mathematics 2015; 16 (1): 67-76.
[7] Clifford AH, Preston GB. The Algebraic Theory of Semigroups, Vol. I and Vol. II. Mathematical Surveys, Providence, RI, USA: American Mathematical Society, 1961/1967.
[8] Desormeaux WJ, Haynes TW, Henning MA. Bounds on the connected domination number of a graph. Discrete Applied Mathematics 2013; 161: 2925-2931.
[9] Desormeaux WJ, Henning MA. Lower bounds on the total domination number of a graph. Journal of Combinatorial Optimization 2016; 31: 52-66.
[10] Hao G, Qian J. Bounds on the domination number of a digraph. Journal of Combinatorial Optimization 2018; 35: 64-74.
[11] Honyam P, Sanwong J. Semigroups of transformations with fixed sets. Quaestiones Mathematicae 2013; 36 (1): 79-92.
[12] Howie JM. Fundamentals of Semigroup Theory. New York, NY, USA: Oxford University Press, 1995.
[13] López SC, Muntaner-Batle FA. Connectivity and other invariants of generalized products of graphs. Acta Mathematica Hungarica 2015; 145 (2): 283-303.
[14] Nupo N, Panma S. Independent domination number in Cayley digraphs of rectangular groups. Discrete Mathematics, Algorithms and Applications 2018; 10 (2). doi: 10.1142/S1793830918500246
[15] Nupo N, Pookpienlert C. On connectedness and completeness of Cayley digraphs of transformation semigroups with fixed sets. International Electronic Journal of Algebra 2020; 28: 110-126. doi: 10.24330/ieja.768190
[16] Pirzada S. An Introduction to Graph Theory. Himayatnagar, Hyderabad, India: Universities Press, 2012.
[17] Sivagami M, Chelvam TT. On the trace graph of matrices. Acta Mathematica Hungarica 2019; 158 (1): 235-250.
[18] Ye A, Miao F, Shao Z, Liu J, Žerovnik J, Repolusk P. More results on the domination number of Cartesian product of two directed cycles. Mathematics 2019; 7 (2). doi: 10.3390/math7020210