EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS.

Shuji Jinbo, Akira Maruoka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
PublisherACM (Order n 508850)
Pages88-97
Number of pages10
ISBN (Print)0897911512
Publication statusPublished - 1985
Externally publishedYes

Fingerprint

Linear algebra

ASJC Scopus subject areas

  • Software

Cite this

Jinbo, S., & Maruoka, A. (1985). EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 88-97). ACM (Order n 508850).

EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS. / Jinbo, Shuji; Maruoka, Akira.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), 1985. p. 88-97.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jinbo, S & Maruoka, A 1985, EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), pp. 88-97.
Jinbo S, Maruoka A. EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850). 1985. p. 88-97
Jinbo, Shuji ; Maruoka, Akira. / EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. ACM (Order n 508850), 1985. pp. 88-97
@inproceedings{deef476cef73485fb1bf541f039c8a83,
title = "EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS.",
abstract = "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.",
author = "Shuji Jinbo and Akira Maruoka",
year = "1985",
language = "English",
isbn = "0897911512",
pages = "88--97",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM (Order n 508850)",

}

TY - GEN

T1 - EXPANDERS OBTAINED FROM AFFINE TRANSFORMATIONS.

AU - Jinbo, Shuji

AU - Maruoka, Akira

PY - 1985

Y1 - 1985

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

M3 - Conference contribution

AN - SCOPUS:0021901601

SN - 0897911512

SP - 88

EP - 97

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

PB - ACM (Order n 508850)

ER -