Repozytorium publikacji - Politechnika Gdańska

Let G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating set if it is convex and dominating set. The convex domination number \gamma_con(G) of a graph G equals the minimum cardinality of a convex dominating set in G. The convex domination subdivision number sd_con (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the convex domination number. In this paper we initiate the study of convex domination subdivision number and we establish upper bounds for it.

Autorzy

• dr inż. Magda Dettlaff link otwiera się w nowej karcie ,
• dr inż. Magdalena Lemańska link otwiera się w nowej karcie ,
• Saeed Kosary,
• Seyed Sheikholeslami