Automorfisma Graf Barbel

Abstract

The automorphism of a graph G is a permutation of the set of points V(G) of the graph G which is neighborhood preserving. In other words, the automorphism of a graph G is an isomorphism of the graph G to itself. One of the main points discussed in this research is the number of automorphism functions of Complete Barbell graphs. Complete Barbell (Bn,km) is a barbell-shaped graph with two identical complete graphs at the ends connected by one bridge. The research results show that the number of automorphism of the Complete Barbell graph (Bn,km) is 2(m!(m−2)!) 2 for n=2.