A characterization of graphs with upper locating-domination number equal to $n-2$
نویسندگان
1 Laboratory, Department of Mathematics (LATSI), Faculty of Sciences, University of Blida 1, P.O.Box 270, Blida, Algeria
2 Laboratory of Mathematics and its Applications (LMA), Faculty of Sciences, Medea University, Medea, Algeria
3 Laboratory of Mathematics and its Applications (LMA), Faculty of Technology, Medea University, Medea, Algeria
doi
10.22108/toc.2025.139873.2128چکیده
A set $D$ of vertices in a graph $G$ is called a dominating set of $G$ if every vertex in $V\left( G\right) \backslash D$ has at least one neighbor in $D$. A dominating set $D$ of $G$ is called a locating-dominating set of $G$ if every two vertices in $V\left( G\right) \backslash D$ have two distinct neighborhood sets. The upper locating-domination number $\Gamma_{L}(G)$ is the maximum cardinality of a minimal locating-dominating set of $G.$ In this paper, we characterize the graphs with $\Gamma_{L}\left( G\right) =n-2$.
