نتایج جستجو برای: edge geodetic number
تعداد نتایج: 1265013 فیلتر نتایج به سال:
-Given two vertices u and v of a connected graph G=(V, E), the closed interval I[u, v] is that set of all vertices lying in some u-v geodesic in G. A subset of V(G) S={v1,v2,v3,....,vk} is a linear geodetic set or sequential geodetic set if each vertex x of G lies on a vi – vi+1 geodesic where 1 ≤ i < k . A linear geodetic set of minimum cardinality in G is called as linear geodetic number lgn(...
In this paper, we introduce a new graph theoretic parameter, split edge geodetic domination number of connected as follows. A set S ⊆ V(G) is said to be dominating G if both and ( < V-S > disconnected). The minimum cardinality the called denoted by γ1gs(G). It shown that for any 3 positive integers m, f nwith 2 ≤ m n-2, there exists order n such g1 (G) = γ1gs f. For every pair l, with l γ1gs(G)...
a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$. a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$. a geodetic dominating set $s$ is both a geodetic and a dominating set. the geodetic (domination, geodetic domination) number...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید