On the signed domination number of some Cayley graphs
Saeid Alikhani, Fatemeh Ramezani, Ebrahim Vatandoost

TL;DR
This paper investigates the signed domination number of Cayley graphs generated by subsets of finite groups, providing formulas based on subset size and classifying groups accordingly.
Contribution
It derives the signed domination number for Cayley graphs from finite groups and classifies groups based on subset size and domination number.
Findings
Signed domination number formulas depending on subset size
Classification of groups based on domination number and subset size
Explicit determination of domination number for specific Cayley graphs
Abstract
A signed dominating function of graph is a function such that for each . The signed domination number is the minimum weight of a signed dominating function on . Let be a finite group such that . In this paper, we obtain the signed domination number of based on cardinality of . Also we determine the classification of group by and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
