نتایج جستجو برای: twin minus domination in digraphs
تعداد نتایج: 16986047 فیلتر نتایج به سال:
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphsMCK(d, ) and it is derived from the Kautz...
The principle of inclusion-exclusion is specialized in order to count labeled digraphs with separately speciied out-components, in-components, and isolated components. Applications include counting digraphs with no in-nodes or out-nodes, digraphs with a source and a sink, and digraphs with a unique source and a unique sink.
The nonexistence of digraphs with order equal to the Moore bound Md;k = 1+d+: : :+d k for d; k > 1 has lead to the study of the problem of the existence ofàlmost' Moore digraphs, namely digraphs with order close to the Moore bound. In 1], it was shown that almost Moore digraphs of order Md;k ? 1, degree d, diameter k (d; k 3) contain either no cycle of length k or exactly one such cycle. In thi...
In this paper, D = (V (D), A(D)) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V (D). Given a digraph D, we say that D is 3-quasi-transitive if, whenever u → v → w → z in D, then u and z are adjacent. In [3], Bang-Jensen introduced 3-quasi-transitive digraphs and claimed that the only strong 3quasi-transitive digraphs are the ...
Ultrasound has revolutioned the care of women carring twins. First trimester evaluation is the best time to determine chorioniocity and amnioniocity in multiple gestations. First trimester diagnosis is based on the number of gestational sacs, amnions and yolk sacs. Growth rate in multiple multiple gestations during the fist and early second trimesters parallels the growth rate of singleton preg...
We construct a family of Cayley digraphs of degree d, diameter k and order kbd/2ck for any d ≥ 4 and k ≥ 3. We also present a collection of bipartite Cayley digraphs of order at least (k − 1)bd/2ck−1 for any degree d ≥ 4 and diameter k ≥ 4. For sufficiently large d and k, our digraphs are the largest known Cayley digraphs of degree d and diameter k, where k 6= d − 1 or d, and our bipartite digr...
Aharoni, R. and I. Ben-Arroyo Hartman, On Greene-Kleitman’s theorem for general digraphs, Discrete Mathematics 120 (1993) 13-24. Linial conjectured that Greene-Kleitman’s theorem can be extended to general digraphs. We prove a stronger conjecture of Berge for digraphs having k-optimal path partitions consisting of ‘long’ paths. The same method yields known results for acyclic digraphs, and exte...
We consider finite graphs G with vertex set V (G). A subset D ⊆ V (G) is a dominating set of the graph G, if every vertex v ∈ V (G) − D is adjacent to at least one vertex in D. The domination number γ(G) is the minimum cardinality among the dominating sets of G. In this note, we characterize the trees T with an even number of vertices such that γ(T ) = |V (T )| − 2
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable set. We also show that Linial’s Conjecture holds for spine digraphs.
We give a decomposition formula for the characteristic polynomials of ramified uniform covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic polynomials of ramified regular covers of digraphs. As applications, we establish decomposition formulas for the characteristic polynomials of branched covers of digraphs and the zeta functions of ramified covers of digraphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید