نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
واریته alyssum minus (l.) rothm. var. minusبرای اولین بار از ایران گزارش می شود. واریتهای جدید (alyssum minus var. mazandaranicum pakravan & bolourian) از شمال و غرب علاوه بر واریتههای موجود در ایران (a. minus (l.) rothm. var. minus, -var. strigosum (banks & sol.) zohary, -var. micranthum (c.a.mey.) dudley ( معرفی می شود و صفات ریختشناسی، گردهشناسی و تشریحی جهت یافتن ویژگیهای جداکن...
in this paper we defined the vertex removable cycle in respect of the following, if $f$ is a class of graphs(digraphs) satisfying certain property, $g in f $, the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $. the vertex removable cycles of eulerian graphs are studied. we also characterize the edge removable cycles of regular graphs(digraphs).
Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...
The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improv...
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...
a roman dominating function (rdf) on a graph g = (v,e) is defined to be a function satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. a set s v is a restrained dominating set if every vertex not in s is adjacent to a vertex in s and to a vertex in . we define a restrained roman dominating function on a graph g = (v,e) to be ...
BACKGROUND Adult cardiorespiratory fitness and muscle strength are related to all-cause and cardiovascular mortality. Both are possibly related to birth weight, but it is unclear what the importance is of genetic, maternal and placental factors in these associations. DESIGN Peak oxygen uptake and measures of strength, flexibility and balance were obtained yearly during adolescence (10-18 year...
Deoxycytidylate (DCMP) deaminase was assayed at various times during and after normal and abnormal pregnancies. The level in amniotic fluid was assessed at induction and at caesarean section, and cord blood levels were estimated after normal delivery and at caesarean section. A rise occurred during labour and after hysterectomy and caesarean section--returning to normal after 2-3, and 12 days r...
We obtain upper bounds for the upper generalized exponents of digraphs in the class of ministrong digraphs and in the class of non-primitive ministrong digraphs, characterize the corresponding extremal digraphs, and discuss the numbers attainable as upper generalized exponents of ministrong digraphs.
4 We prove that the weak k-linkage problem is polynomial for every fixed k for totally Φ5 decomposable digraphs, under appropriate hypothesis on Φ. We then apply this and recent results 6 by Fradkin and Seymour (on the weak k-linkage problem for digraphs of bounded independence 7 number or bounded cut-width) to get polynomial algorithms for some class of digraphs like quasi8 transitive digraphs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید