Binding number conditions for matching extension
نویسندگان
چکیده
منابع مشابه
Best monotone degree conditions for binding number
We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b > 0. Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is hamiltonian is best possible.
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملMatching Objects Without Language Extension
Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems. But existing proposals for pattern matching in such languages rely on language extension, which makes their adoption overly intrusive. We propose an ap...
متن کاملBarycentric extension of generalized matching.
In most studies of choice under concurrent schedules of reinforcement, two physically identical operanda are provided. In the "real world," however, more than two choice alternatives are often available and biases are common. This paper describes a method for studying choices among an indefinite number of alternatives when large biases are present. Twenty rats were rewarded for choosing among f...
متن کاملGame matching number of graphs
We study a competitive optimization version of α(G), the maximum size of a matching in a graph G. Players alternate adding edges of G to a matching until it becomes a maximal matching. One player (Max) wants that matching to be large; the other (Min) wants it to be small. The resulting sizes under optimal play when Max or Min starts are denoted α g(G) and α̂ ′ g(G), respectively. We show that al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00192-3