EJC
2010
14 years 9 months ago
2010
Let X = (V, E) be a finite simple connected graph with n vertices and m edges. A configuration is an assignment of one of two colors, black or white, to each edge of X. A move app...
89
Voted
EJC
2010
14 years 9 months ago
2010
Let G be a simple connected graph with n vertices and n edges which we call an unicyclic graph. In this paper, we first investigate the least eigenvalue n(G), then we present two ...
SIROCCO
2000
14 years 10 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...