On the distinguishing number of functigraphs

DOI10.3390/SYM10080332zbMATH Open1423.05067arXiv1612.00971OpenAlexW2963095104MaRDI QIDQ2333653FDOQ2333653

Authors: Muhammad Fazil, M. Murtaza, Zafar Ullah, Imran Javaid, Usman Ali 

Publication date: 13 November 2019

Published in: Symmetry (Search for Journal in Brave)

Abstract: Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $g:V(G_1)ightarrowV(G_2)$ be a function. A functigraph $F_G$ consists of the vertex set $V(G_1)cupV(G_2)$ and the edge set $E(G_1)cupE(G_2)cupuv:g(u)=v$. In this paper, we extend the study of the distinguishing number of a graph to its functigraph. We discuss the behavior of the distinguishing number in passing from $G$ to $F_G$ and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs.

Full work available at URL: https://arxiv.org/abs/1612.00971

Recommendations

• On the fixing number of functigraphs
• Functigraphs: An extension of permutation graphs
• On metric dimension of functigraphs
• Domination in functigraphs
• Distinguishing number and distinguishing index of join of two specific graphs

zbMATH Keywords

complete graphdistinguishing numberfunctigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Symmetry breaking in graphs
• Methods of destroying the symmetries of a graph
• Title not available (Why is that?)
• Identifying graph automorphisms using determining sets
• Functigraphs: An extension of permutation graphs
• Distinguishing numbers for graphs and groups
• The distinguishing chromatic number
• Distinguishing graphs by edge-colourings
• On computing the distinguishing numbers of trees and forests
• Using determining sets to distinguish Kneser graphs
• Distinguishing Cartesian powers of graphs
• On the distinguishing number of functigraphs
• The distinguishing number of the hypercube
• Title not available (Why is that?)
• The maximum distinguishing number of a group
• The relationship between node degree and dissipation rate in networks of diffusively coupled oscillators and its significance for pancreatic beta cells
• Domination in functigraphs
• Minimal asymmetric graphs
• On metric dimension of functigraphs

Cited In (5)

• On the distinguishing number of functigraphs
• On metric dimension of functigraphs
• On the fixing number of functigraphs
• Locating-dominating sets of functigraphs
• The number of excellent discrete Morse functions on graphs

This page was built for publication: On the distinguishing number of functigraphs

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