نتایج جستجو برای: Semi vertex
تعداد نتایج: 181083 فیلتر نتایج به سال:
Semi-infinite forms on the moduli spaces of genus-zero Riemann surfaces with punctures and local coordinates are introduced. A partial operad for semi-infinite forms is constructed. Using semi-infinite forms and motivated by a partial suboperad of the partial operad for semi-infinite forms, topological vertex partial operads of type k < 0 and strong topological vertex partial operads of type k ...
Let G(p, q) be a connected graph and Mv (G) its corresponding vertex semi middle graph. A dominating set D⊆V[Mv (G)] is Nonsplit 〈V[Mv (G)]-D〉 connected. The minimum size of D called the domination number denoted by γns [Mv (G)]. In this paper we obtain several results on number.
It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is isomorphic to a bi-coset graph. In this paper, we prove that random bi-coset graphs are almost always concentrators, and construct some examples of semi-vertex transitive concentrators.
A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors...
The level 1 highest weight modules of the quantum affine algebra Uq(ŝln) can be described as spaces of certain semi-infinite wedges. Using a q-antisymmetrization procedure, these semi-infinite wedges can be realized inside an infinite tensor product of evaluation modules. This realization gives rise to simple descriptions of vertex operators and (up to a scalar function) their compositions. 1 R...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید