TY - GEN

T1 - EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS.

AU - Jimbo, Shuji

AU - Maruoka, Akira

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Using relatively elementary analysis in linear algebra, the authors establish some general results to estimate the expanding coefficients of bipartite graphs whose edges are defined by a finite number of some affine transformations. They prove that the constant delta of a bipartite graph is bounded below by 1 - lambda //2, where lambda //2 is the second largest eigenvalue of the matrix determined by affine transformations to specify the bipartite graph. Using these results, they can estimate the expanding coefficients of not only O. Grabber and Z. Galil's bipartite graphs but also some other graphs with good properties.

AB - Using relatively elementary analysis in linear algebra, the authors establish some general results to estimate the expanding coefficients of bipartite graphs whose edges are defined by a finite number of some affine transformations. They prove that the constant delta of a bipartite graph is bounded below by 1 - lambda //2, where lambda //2 is the second largest eigenvalue of the matrix determined by affine transformations to specify the bipartite graph. Using these results, they can estimate the expanding coefficients of not only O. Grabber and Z. Galil's bipartite graphs but also some other graphs with good properties.

UR - http://www.scopus.com/inward/record.url?scp=0021901601&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021901601&partnerID=8YFLogxK

U2 - 10.1145/22145.22155

DO - 10.1145/22145.22155

M3 - Conference contribution

AN - SCOPUS:0021901601

SN - 0897911512

SN - 9780897911511

T3 - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 88

EP - 97

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM (Order n 508850)

ER -