Sciweavers

2063 search results - page 75 / 413
» connection 2007
Sort
View
EJC
2006
14 years 11 months ago
Invariant subspaces, duality, and covers of the Petersen graph
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 ...
Aleksander Malnic, Primoz Potocnik
DM
2007
113views more  DM 2007»
14 years 11 months ago
Counting labeled general cubic graphs
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...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
14 years 11 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
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 ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
APAL
2005
78views more  APAL 2005»
14 years 11 months ago
The logic of proofs, semantically
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...
Melvin Fitting
JGT
2007
85views more  JGT 2007»
14 years 11 months ago
Between ends and fibers
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...
C. Paul Bonnington, R. Bruce Richter, Mark E. Watk...