On Fixing number of Functigraphs

Authors Muhammad Fazil, Imran Javaid, M. Murtaza

Publication date 10 November 2016

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: The fixing number of a graph

G

is the order of the smallest subset

S

of its vertex set

V (G)

such that stabilizer of

S

in

G

,

G a m m a_{S} (G)

is trivial. Let

G_{1}

and

G_{2}

be disjoint copies of a graph

G

, and let

g : V (G_{1}) i g h t a r r o w V (G_{2})

be a function. A functigraph

F_{G}

consists of the vertex set

V (G_{1}) c u p V (G_{2})

and the edge set

E (G_{1}) c u p E (G_{2}) c u p u v : v = g (u)

. In this paper, we study the behavior of the fixing number in passing from

G

to

F_{G}

and find its sharp lower and upper bounds. We also study the fixing number of functigraphs of some well known families of graphs like complete graphs, trees and join graphs.

This page was built for publication: On Fixing number of Functigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6279623)