2063 search results - page 75 / 413 » connection 2007 |
92
Voted
EJC
2006
15 years 19 days 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 ...
98
Voted
DM
2007
15 years 18 days ago
2007
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
114
click to vote
ALGORITHMICA
2005
15 years 16 days ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
88
Voted
APAL
2005
15 years 16 days ago
2005
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...
81
Voted
JGT
2007
15 years 15 days ago
2007
Let Γ be an infinite, locally finite, connected graph with distance function δ. Given a ray P in Γ and a constant C ≥ 1, a vertex-sequence {xn}∞ n=0 ⊆ V P is said to be...