On some automorphism related parameters in graphs
classification
🧮 math.CO
keywords
fixingconceptconnectedgraphssharesomevertexamount
read the original abstract
In this paper, we deduce some properties of $f$-sets of connected graphs. Also, we introduce the concept of fixing share of each vertex of a fixing set $D$ to see the participation of each vertex when fixing a connected graph $G$. We define a parameter, called the fixing percentage, by using the concept of fixing share, which is helpful in determining the measure of the amount of fixing done by the elements of $D$ in $G$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.