On the Distinguishing Number of Functigraphs
Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan
Department of Mathematics, University of Education Lahore, Campus Dera Ghazi Khan 32200, Pakistan
Author to whom correspondence should be addressed.
Received: 3 July 2018 / Revised: 4 August 2018 / Accepted: 4 August 2018 / Published: 9 August 2018
be disjoint copies of a graph G
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
and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs.
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. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Fazil, M.; Murtaza, M.; Ullah, Z.; Ali, U.; Javaid, I. On the Distinguishing Number of Functigraphs. Symmetry 2018, 10, 332.
Fazil M, Murtaza M, Ullah Z, Ali U, Javaid I. On the Distinguishing Number of Functigraphs. Symmetry. 2018; 10(8):332.
Fazil, Muhammad; Murtaza, Muhammad; Ullah, Zafar; Ali, Usman; Javaid, Imran. 2018. "On the Distinguishing Number of Functigraphs." Symmetry 10, no. 8: 332.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.