Topics concerning metric dimension related invariants in graphs are nowadays intensively
studied. This compendium of combinatorial and computational results on this topic is an …

On the strong metric dimension of sun graph, windmill graph, and möbius ladder graph Page 1
Journal of Physics: Conference Series PAPER • OPEN ACCESS On the strong metric dimension …

Coronoid systems are actually geometric arrangements of six-sided benzenoids in
hexagonal form. Coronoid systems are organic chemical structures, that fall into two …

A shortest path between two vertices u and v in a connected graph G is au− v geodesic. A
vertex w of G performs the geodesic identification for the vertices in a pair (u, v) if either v …

Let G be a connected graph with vertex set V (G) and edge set E (G). For every pair of
vertices $ u, v\in V (G) $, the interval I [u, v] between u and v to be the collection of all vertices …

Let G be a connected graph with vertex set V (G) and edge set E (G). The interval I [u, v]
between u and v is defined as the collection of all vertices that belong to some shortest u− v …

Let G be a connected graph with a set of vertices V (G) and a set of edges E (G). The interval
I [u, v] between u and v to be the collection of all vertices that belong to some shortest uv …

Daftar Rujukan Page 1 Daftar Rujukan [1] Chao, CY, and S. Han, On the Toughness of Cycle
Permutation Graphs, Czechoslovak Mathematical Journal 51 (2001), no. 126, 239–260. [2] …

Bagisti, Batas Atas Bilangan Dominasi Sisi pada Graf Bunga Matahari SFn, di bawah
bimbingan Yanne Irene M. Si. dan Wisnu Aribowo, M. Si. Graf G=(V, E) adalah sebuah graf …

A vertex v of a connected graph G identifies a pair (x, y) of vertices if the number of edges in
av− x geodesic (shortest path) is different from the number of edges in v− y geodesic. A …