Locating-Dominating Sets of Functigraphs

DOI10.1016/J.TCS.2019.09.051MaRDI QIDQ6291345arXivWikidataFDO

Authors M. Murtaza, Muhammad Fazil, Imran Javaid

Publication date 15 September 2017

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.TCS.2019.09.051

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

arXiv classification

math.CO

Abstract: A locating-dominating set of a graph $G$ is a dominating set of $G$ such that every vertex of $G$ outside the dominating set is uniquely identified by its neighborhood within the dominating set. The location-domination number of $G$ is the minimum cardinality of a locating-dominating set in $G$. Let $G_1$ and $G_2$ be the disjoint copies of a graph $G$ and $f:V(G_1)ightarrowV(G_2)$ be a function. A functigraph $F_G^f$ consists of the vertex set $V(G_1)cupV(G_2)$ and the edge set $E(G_1)cupE(G_2)cupuv:v=f(u)$. In this paper, we study the variation of the location-domination number in passing from $G$ to $F_G^f$ and find its sharp lower and upper bounds. We also study the location-domination number of functigraphs of the complete graphs for all possible definitions of the function $f$. We also obtain the location-domination number of functigraphs of a family of spanning subgraph of the complete graphs.

This page was built for publication: Locating-Dominating Sets of Functigraphs

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