Expansion Properties Of Levi Graphs

13 years 11 months ago

Download www.math.jmu.edu

ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those points it contains. We derive upper and lower bounds on the isoperimetric numbers of such graphs, with particular attention to the special cases of finite projective planes and Hadamard designs.

Dominic Lanphier, C. Miller, Jason Rosenhouse, A.

Real-time Traffic

ARSCOM 2006 | Balanced Incomplete Block Design | Bipartite Graph | Levi Graph |

claim paper

» Expansion properties of a random regular graph after random vertex deletions

» A Convexity Lemma and Expansion Procedures for Bipartite Graphs

» Testing Hereditary Properties of NonExpanding BoundedDegree Graphs

» An Expansion Tester for Bounded Degree Graphs

» The expansion and mixing time of skip graphs with applications

» Zigzag and Replacement Product Graphs and LDPC Codes

» On Testing Expansion in BoundedDegree Graphs

» A New Framework for Approximate Labeling via Graph Cuts

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ARSCOM
Authors	Dominic Lanphier, C. Miller, Jason Rosenhouse, A. Russell

Comments (0)

Sciweavers

Expansion Properties Of Levi Graphs

ARSCOM 2006 | Balanced Incomplete Block Design | Bipartite Graph | Levi Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers