36781 search results - page 107 / 7357 » Parameterizing by the Number of Numbers |
IM
2007
13 years 10 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
JGT
2007
13 years 10 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
JSAC
2007
13 years 10 months ago
2007
Abstract— We consider path-based survivable service provisioning in transparent optical networks with the constraints of wavelength continuity and a limited number of add/drop po...
MOC
1998
13 years 10 months ago
1998
We count lattice points in certain rational simplices associated with an irreducible finite Weyl group W and observe that these numbers are linked to the exponents of W .
RSA
2002
13 years 10 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...