2432 search results - page 3 / 487 » Degrees and choice numbers |
IAT
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--In this paper, we study the method of ranking intuitionistic fuzzy numbers. Firstly a possibility degree formula is defined to compare two intuitionistic fuzzy numbers. W...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
DM
2008
14 years 11 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
APPML
2008
14 years 11 months ago
2008
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...