Sciweavers

1215 search results - page 103 / 243
» Combinatorics
Sort
View
121
Voted
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
15 years 3 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
15 years 3 months ago
The Circular Chromatic Index of Flower Snarks
We determine the circular chromatic index of flower snarks, by showing that c(F3) = 7/2, c(F5) = 17/5 and c(Fk) = 10/3 for every odd integer k 7, where Fk denotes the flower snar...
Mohammad Ghebleh, Daniel Král, Serguei Nori...
114
Voted
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
15 years 3 months ago
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 t 50 using computer programs, which are useful in recursive constructions for cyclic designs....
Kejun Chen, Ruizhong Wei
114
Voted
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
15 years 3 months ago
Sets of Points Determining Only Acute Angles and Some Related Colouring Problems
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...
David Bevan
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
15 years 3 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison