نتایج جستجو برای: various sources of geodetic
تعداد نتایج: 21183841 فیلتر نتایج به سال:
For two vertices u and v of a connected graph G, the set IG[u, v] consists of all those vertices lying on u − v geodesics in G. Given a set S of vertices of G, the union of all sets IG[u, v] for u, v ∈ S is denoted by IG[S]. A set S ⊆ V (G) is a geodetic set if IG[S] = V (G) and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong ...
there is less published research about how teachers in efl contexts respond to students who are relatively less mature and less competent l2 writers. while writing researchers have examined various issues concerning peer and teacher response in writing-oriented classes, little research has centered on the effect of collaborative tasks particularly dictogloss on writing skills. output collaborat...
The recent development of the International Global Navigation Satellite Systems Service Real-Time Pilot Project and the enormous progress in precise point positioning (PPP) techniques provide a promising opportunity for real-time determination of IntegratedWater Vapor (IWV) using GPS ground networks for various geodetic and meteorological applications. In this study, we develop a new real-time ...
A digraph G = (V, E) with diameter D is said to be s-geodetic, for 1 ≤ s ≤ D, if between any pair of (not necessarily different) vertices x, y ∈ V there is at most one x → y path of length ≤ s. Thus, any loopless digraph is at least 1-geodetic. A similar definition applies for a graph G, but in this case the concept is closely related to its girth g, for then G is s-geodetic with s = b(g − 1)/2...
Given a graph G and a subset W ⊆ V (G), a Steiner W -tree is a tree of minimum order that contains all of W . Let S(W ) denote the set of all vertices in G that lie on some Steiner W -tree; we call S(W ) the Steiner interval of W . If S(W ) = V (G), then we call W a Steiner set of G. The minimum order of a Steiner set of G is called the Steiner number of G. Given two vertices u, v in G, a short...
in recent years many researchers have been focused on interaction of small molecules with dna. dna is generally the primary intracellular of anticancer drugs, so the interaction between small molecules and dna can cause dna damage in cancer cells, blocking the division of cancer cells and resulting in cell death. the flavonoids are a large group of polyphenolic natural products that are widely ...
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...
wireless sensor networks (wsns) are one of the most interesting consequences of innovations in different areas of technology including wireless and mobile communications, networking, and sensor design. these networks are considered as a class of wireless networks which are constructed by a set of sensors. a large number of applications have been proposed for wsns. besides having numerous applic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید