Sciweavers

307 search results - page 12 / 62
» Finite locally-quasiprimitive graphs
Sort
View
EJC
2010
13 years 10 months ago
Shilla distance-regular graphs
A Shilla distance-regular graph (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide...
Jack H. Koolen, Jongyook Park
EJC
2008
13 years 10 months ago
A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type
A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every lin...
Alice Devillers
ASAP
2006
IEEE
162views Hardware» more  ASAP 2006»
14 years 1 months ago
Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close...
Ed F. Deprettere, Todor Stefanov, Shuvra S. Bhatta...
COMBINATORICA
2006
125views more  COMBINATORICA 2006»
13 years 10 months ago
Coloring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
Norbert W. Sauer
COLOGNETWENTE
2009
13 years 11 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos