Sciweavers

36781 search results - page 343 / 7357
» Parameterizing by the Number of Numbers
Sort
View
ENDM
2007
111views more  ENDM 2007»
15 years 7 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu
IM
2007
15 years 7 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
198
Voted
CORR
2002
Springer
93views Education» more  CORR 2002»
15 years 7 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
163
Voted
DM
1998
100views more  DM 1998»
15 years 7 months ago
Upper domination and upper irredundance perfect graphs
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
Gregory Gutin, Vadim E. Zverovich
IAJIT
2011
15 years 2 months ago
Build electronic arabic lexicon
: There are many known Arabic lexicons organized on different ways, each of them has a different number of Arabic words according to its organization way. This paper has used mathe...
Nidhal El-Abbadi, Ahmed Khdhair, Adel Al-Nasrawi