نتایج جستجو برای: regular pair
تعداد نتایج: 238628 فیلتر نتایج به سال:
A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...
A regular nonempty graph Γ is called edge regular, whenever there exists a nonegative integer λΓ, such that any two adjacent vertices of Γ have precisely λΓ common neighbours. An edge regular graph Γ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer μΓ, such that any two vertices at distance 2 have precisely μΓ common neighbours...
the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...
We define a trivariate polynomial combining the NL-coflow and NL-flow polynomial, which build dual pair counting acyclic colorings of directed graphs, in more general setting regular oriented matroids.
In this paper we introduce some contractive conditions of Meir–Keeler type for two mappings, called f -MK -pair mappings and f -CJM-pair (from Ciric, Jachymski, and Matkowski) mappings, in the framework of regular cone metric spaces and we prove theorems which guarantee the existence and uniqueness of common fixed points. We give also a fixed point result for a multivalued mapping that satisfie...
in this paper some properties of weak regular injectivity for $s$-posets, where $s$ is a pomonoid, are studied. the behaviour of different kinds of weak regular injectivity with products, coproducts and direct sums is considered. also, some characterizations of pomonoids over which all $s$-posets are of some kind of weakly regular injective are obtained. further, we giv...
let $g$ be an $(n,m)$-graph. we say that $g$ has property $(ast)$if for every pair of its adjacent vertices $x$ and $y$, thereexists a vertex $z$, such that $z$ is not adjacentto either $x$ or $y$. if the graph $g$ has property $(ast)$, thenits complement $overline g$ is connected, has diameter 2, and itswiener index is equal to $binom{n}{2}+m$, i.e., the wiener indexis insensitive of any other...
A pair-copula construction is a decomposition of a multivariate copula into a structured system, called regular vine, of bivariate copulae or pair-copulae. The standard practice is to model these pair-copulae parametri-cally, which comes at the cost of a large model risk, with errors propagating throughout the vine structure. The empirical pair-copula proposed in the paper provides a nonparamet...
We introduce here two types of balanced nested designs (BND), which are called symmetric and pair-sum BNDs. In this paper, we give a construction for pair-sum BNDs of BIBDs from nested BIBDs and perpendicular arrays. We also give some direct constructions for pair-sum BNDs of BIBDs, based on the result obtained by Wilson (1972). By use of these constructions, we show some constructions for regu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید