نتایج جستجو برای: edge geodetic number
تعداد نتایج: 1265013 فیلتر نتایج به سال:
For two vertices u and v of a graph G, the closed interval I[u, v] consists of u, v, and all vertices lying in some u − v geodesic in G. If S is a set of vertices of G, then I[S] is the union of all sets I[u, v] for u, v ∈ S. If I[S] = V (G), then S is a geodetic set for G. The geodetic number g(G) is the minimum cardinality of a geodetic set. A set S of vertices in a graph G is uniform if the ...
one of the generalizations of the wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. the reliability wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. closed expressions are derived for t...
Foucaud, Krishna and Ramasubramony Sulochana recently introduced the concept of monitoring edge-geodetic sets in graphs, a related graph invariant. These are vertices such that removal any edge changes distance between some pair set. They studied minimum possible size set given graph, which we call number. We show decision problem for number is NP-complete. also give best-possible upper lower b...
We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that the Steiner number is at least the geodetic number in AT-free graphs. Computing a maximal and proper monophonic set in AT-free graphs is NP-complete. We present polynomial algorithms for the monophonic number in perm...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید