Let be a graph with vertex set , a permutation of . Define and , where the sum is taken over all unordered pair , of distinct vertices of . , where and . Let denote the smallest positive value of among all permutations of . A permutation with is called a near automorphisms of \cite{HV}. In this paper, we define is a graph obtained from by add pendent vertices to which is a vertex of , , and we say is a c-pendent vertex of . We determine and describe permutations of for which . Because is a star and it is easy, hence we let . Suppose has c-pendent vertices and has pendent vertices(). For we have For we have

生成讲解博客的中文版本

生成AI智能校验的中文版本