On the distinguishing number of functigraphs

DOI10.3390/SYM10080332MaRDI QIDQ2333653zbMATH OpenOpenAlexFDO

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

Publication date 13 November 2019

Published in Symmetry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

complete graphdistinguishing numberfunctigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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.

Review text

Summary: Let \(G_1\) and \(G_2\) be disjoint copies of a graph \(G\) and \(g : V(G_1) \rightarrow V(G_2)\) be a function. A functigraph \(F_G\) consists of the vertex set \(V(G_1) \cup V(G_2)\) and the edge set \(E(G_1) \cup E(G_2) \cup \{u v : g(u) = v \}\). In this paper, we extend the study of distinguishing numbers of a graph to its functigraph. We discuss the behavior of 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.

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

Cites work

• Distinguishing Cartesian powers of graphs
• Distinguishing graphs by edge-colourings
• Distinguishing numbers for graphs and groups
• Domination in functigraphs
• Functigraphs: An extension of permutation graphs
• scientific article; zbMATH DE number 3654154 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Identifying graph automorphisms using determining sets
• Methods of destroying the symmetries of a graph
• Minimal asymmetric graphs
• On computing the distinguishing numbers of trees and forests
• On metric dimension of functigraphs
• On the distinguishing number of functigraphs
• Symmetry breaking in graphs
• The distinguishing chromatic number
• The distinguishing number of the hypercube
• 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
• Using determining sets to distinguish Kneser graphs

Cited in

(6)

• On the distinguishing number of functigraphs
• Locating-dominating sets of functigraphs
• On metric dimension of functigraphs
• On the fixing number of functigraphs
• The number of excellent discrete Morse functions on graphs
• Automorphism group and related parameters of nonzero component union graph over a vector space

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)