On the fixing number of graphs with abelian automorphism group


The fixing number of a graph G is the cardinality of a smallest set of vertices of G that is not fixed by any non-trivial automorphism of G. In this paper we investigate the fixing number of finite graphs with abelian automorphism group. 


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics