Sciweavers

3204 search results - page 266 / 641
» The Alcuin Number of a Graph
Sort
View
EJC
2000
15 years 6 months ago
Further Investigations Involving Rook Polynomials With Only Real Zeros
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
James Haglund
DM
2002
86views more  DM 2002»
15 years 6 months ago
A chip-firing game and Dirichlet eigenvalues
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
Fan R. K. Chung, Robert B. Ellis
IJCM
2002
83views more  IJCM 2002»
15 years 6 months ago
A Radio Coloring of a Hypercube
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
Ophir Frieder, Frank Harary, Peng-Jun Wan
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
15 years 5 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
SOCIALCOM
2010
15 years 4 months ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu