Abstract
Transitivity on graphs is a concept widely investigated. This suggest to analyze the action of automorphisms on other sets. In this paper, we study the action on the family of γ-sets (minimum dominating sets), the graph is called γ-transitive if given two γ-sets there exists an automorphism which maps one onto the other. We deal with two families: paths Pn and cycles Cn. Their γ-sets are fully characterized and the action of the automorphism group on the family of γ-sets is fully analyzed.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference11 articles.
1. New families of graphs determined by their generalized spectrum;Fenjin;Discret. Math.,2019
2. Chromatic number of some families of graphs
3. Puttaswamy. Transversal domination in graphs;Nayaka;Gulf J. Math.,2018
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. On graphs having domination number half their order
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献