The Diametral Metric Dimension of Generalized Corona Graph
Anis Nur Fitria, Liliek Susilowati, Yayuk Wahyuni, Nor Haniza Sarmin
Source abstract
This study investigates the diametral metric dimension of generalized corona graphs, where the main graph is connected graph and the branch graphs form a sequence of connected graphs. The concept of diametral metric dimension is an extension of the metric dimension concept, requiring the resolving set to contain all diametral vertices. To determine the diametral metric dimension of a generalized corona graph, one must first identify the distance of each vertex in the graph and the graph's diametral set. Subsequently, a resolving set containing the diametral set is determined. The results show that the diametral metric dimension of the generalized corona graph depends on the diameter of the main graph and the metric dimensions of the graphs in the sequence. These concepts provide theoretical insights into resolving structures in the planning infrastructure and motivate further studies on other graph families and graph operations.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.