3265 search results - page 45 / 653 » Representing Groups on Graphs |
152
Voted
GG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
116
click to vote
JGT
2010
15 years 1 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
114
Voted
EJC
2006
15 years 3 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
104
Voted
EJC
2006
15 years 3 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
151
Voted
DSD
2003
IEEE
15 years 8 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...