نتایج جستجو برای: somewhat connected
تعداد نتایج: 159320 فیلتر نتایج به سال:
We study that subset of the moduli space M g of stable genus g, g > 1, Riemann surfaces which consists of such stable Riemann surfaces on which a given nite group F acts. We show rst that this subset is compact. It turns out that, for general nite groups F, the above subset is not connected. We show, however, that for Z 2 actions this subset is connected. Finally, we show that even in the modul...
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipulations. We show here that it is possible to make analytic sense of the divergent series that expresses the generating function of connected graphs. As a consequence, it becomes possible to derive analytically known enum...
We determine the 2-color Ramsey number of a connected triangle matching c(nK3) which is a graph with n vertex disjoint triangles plus (at least n − 1) further edges that keep these triangles connected. We obtain that R(c(nK3), c(nK3)) = 7n − 2, somewhat larger than in the classical result of Burr, Erdős and Spencer for a triangle matching, R(nK3, nK3) = 5n. The motivation is to determine the Ra...
To perform automatic, unconscious inference, the human brain must solve the binding problem by correctly grouping properties with objects. Temporal binding models like SHRUTI already suggest much of how this might be done in a connectionist and localist way by using temporal synchrony. We propose a set of alternatives to temporal synchrony mechanisms that instead use short signatures. This serv...
Skill shortage remains one of the major constraints to continued growth of the Indian economy. However, very little research has been conducted to identify which specific skills are in high demand and which skills are in short supply. This employer survey seeks to address this knowledge-gap by answering three questions: (i) which skills do employers consider important when hiring new engineerin...
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, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them. and we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. also, we prove that right and product stabilizers are filters and if they are ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید