On the Distinguishing Number of Functigraphs
1
Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan
2
Department of Mathematics, University of Education Lahore, Campus Dera Ghazi Khan 32200, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(8), 332; https://doi.org/10.3390/sym10080332
Received: 3 July 2018 / Revised: 4 August 2018 / Accepted: 4 August 2018 / Published: 9 August 2018
(This article belongs to the Special Issue Symmetry in Graph Theory)
Let and be disjoint copies of a graph G and be a function. A functigraph consists of the vertex set and the edge set . 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 and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs.
View Full-Text
Keywords:
distinguishing number; functigraph; complete graph
▼
Show Figures
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Fazil, M.; Murtaza, M.; Ullah, Z.; Ali, U.; Javaid, I. On the Distinguishing Number of Functigraphs. Symmetry 2018, 10, 332.
Show more citation formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.