نتایج جستجو برای: P-connected set
تعداد نتایج: 1960713 فیلتر نتایج به سال:
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of 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 geodetic set.the maximum cardinalit...
in this paper, a certain new connectedness of l-fuzzy subsets inl-topological spaces is introduced and studied by means of preclosed sets. itpreserves some fundamental properties of connected set in general topology.especially the famous k. fan’s theorem holds.
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
In this paper, a certain new connectedness of L-fuzzy subsets inL-topological spaces is introduced and studied by means of preclosed sets. Itpreserves some fundamental properties of connected set in general topology.Especially the famous K. Fan’s Theorem holds.
objective: the objective of this study was to investigate the invitro fluoride release of four new self-adhesive resin cements; set (sdi, australia), breeze (pentron, usa), embrace wetbond (pulpdent, usa), g-cem (gc, japan) and to assess the bonding performance of these self-adhesive resin cements for bonding of orthodontic brackets. materials and methods: for fluoride release experiment, six ...
We will give distributed approximation schemes for the maximum matching problem and the minimum connected dominating set problem in unit-disk graphs. The algorithms are deterministic, run in a poly-logarithmic number of rounds in the message passing model and the approximation error can be made O(1/ log |G|) where |G| is the order of the graph and k is a positive integer.
Energy efficiency and reliability are the two important requirements for mission-critical wireless sensor networks. In the context of sensor topology control for routing and dissemination, Connected Dominating Set (CDS) based techniques proposed in prior literature provide the most promising efficiency and reliability. In a CDS-based topology control technique, a backbone – comprising a set of ...
This paper presents a near-optimal distributed approximation algorithm for the minimumweight connected dominating set (MCDS) problem. We use the standard distributed message passing model called the CONGEST model in which in each round each node can send O(log n) bits to each neighbor. The presented algorithm finds an O(log n) approximation in Õ(D+ √ n) rounds, where D is the network diameter a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید