821 search results - page 1 / 165 » Addressing the Petersen graph |
ENDM
2002
13 years 4 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
EJC
2006
13 years 4 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 ...
DM
2002
13 years 4 months ago
2002
GC
2010
Springer
13 years 3 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
DAIS
2011
12 years 8 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...