This article is intended as a survey, updating earlier surveys in the area. For completeness
of the presentation of both particular questions and the general area, it also contains some …

Let $ G=(V (G), E (G)) $ be a simple graph. A set $ D\subseteq V (G) $ is a strong dominating
set of $ G $, if for every vertex $ x\in V (G)\setminus D $ there is a vertex $ y\in D $ with …

The concept of metric dimension of graph could be applied in many graphs, one of them is
subdivision graph. A subdivision graph of graph G denoted as S (G) is a graph resulting from …

Let $ G=(V, E) $ be a simple graph. A dominating set of $ G $ is a subset $ D\subseteq V $
such that every vertex not in $ D $ is adjacent to at least one vertex in $ D $. The cardinality …

Let $ G=(V, E) $ be a simple graph. A dominating set of $ G $ is a subset $ D\subseteq V $
such that every vertex not in $ D $ is adjacent to at least one vertex in $ D $. The cardinality …

It is known that all convex polytopes admit a triangulation without additional vertices,
however this does not hold in general for non-convex polyhedra. If 3-triangulation of some …

Let $ G=(V, E) $ be a simple graph. A dominating set of $ G $ is a subset $ D\subseteq V $
such that every vertex not in $ D $ is adjacent to at least one vertex in $ D $. The cardinality …

The newly appeared G-SGD algorithm can only heuristically find the basis path set in a
simple neural network, so its generalization to a more practical network is hindered. From …

Let G be a graph on n≥ 3 vertices and H be a subgraph of G such that each component of H
is a cycle with at most one chord. In this paper we prove that if the minimum degree of G is at …

Pada penelitian ini dikembangkan konsep dimensi metrik pada graf subdivisi yang
dinamakan dimensi metrik dari graf subdivisi. Tujuan dari penelitian ini adalah menentukan …