Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications

On locating-dominating set of subgraph-amalgamation graphs

Darmaji Darmaji (Department of Mathematics, Institut Teknologi Sepuluh Nopember, Surabaya, Indonesia)
Suhadi Wido Saputro (Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung, Indonesia)



Article Info

Publish Date
29 Oct 2026

Abstract

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






Journal Info

Abbrev

ejgta

Publisher

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...