The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ V(G) such that for every two distinct vertices u, v ∈ V(G) ∖ W, ∅ ≠ NG(u) ∩ W ≠ NG(v) ∩ W ≠ ∅. For n ∈ ℕ and i ∈ {1, 2, …, n}, let Hi be a simple connected graph containing a connected subgraph J. Let ℋ = {H1, H2, …, Hn} be a finite collection of simple connected graphs. The subgraph-amalgamation of ℋ = {H1, H2, …, Hn} in J, denoted by Subgraph-Amal{ℋ; J}, is a graph obtained by identifying all elements of ℋ in J. The subgraph J is called as a terminal subgraph of ℋ. In this paper, we determine general bounds of the locating-dominating number of subgraph-amalgamation graphs for any connected terminal subgraphs. We also determine the locating-dominating number of the vertex-amalgamation graph, which is Subgraph-Amal{ℋ; J} where J is K1.
Copyrights © 2026