Sciweavers

2531 search results - page 10 / 507
» Group testing in graphs
Sort
View
DM
2010
144views more  DM 2010»
13 years 7 months ago
Balanced Cayley graphs and balanced planar graphs
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
Joy Morris, Pablo Spiga, Kerri Webb
COMBINATORICS
2007
65views more  COMBINATORICS 2007»
13 years 7 months ago
On Certain Integral Schreier Graphs of the Symmetric Group
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
Paul E. Gunnells, Richard A. Scott, Byron L. Walde...
COMBINATORICS
2004
74views more  COMBINATORICS 2004»
13 years 7 months ago
Voltage Graphs, Group Presentations and Cages
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...
Geoffrey Exoo
ECCC
2000
117views more  ECCC 2000»
13 years 7 months ago
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Oded Goldreich, Dana Ron
JCT
2008
57views more  JCT 2008»
13 years 7 months ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson