Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 2001: Graph-Theoretic Concepts in Computer Science pp 9–20Cite as

Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Abstract

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best possible edge-isoperimetric inequalities for the cartesian powers of arbitrary regular, resp. regular bipartite, graphs with a high density.

This work was partially supported by the German Research Association (DFG) within the SFB 376 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen”

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlswede R., Bezrukov S.L., Edge Isoperimetric Theorems for Integer Point Arrays, Appl. Math. Lett. 8 (1995), No. 2, 75–80.

    Article  MATH  MathSciNet  Google Scholar 

  2. Ahlswede R., Cai N., General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographic Solution, Europ. J. Combin. 18 (1997), 479–489.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bezrukov S.L., Encoding of analog signals for discrete binary channel, in: Proc. Int. Conf. Algebraic and Combinatorial Coding Theory, Varna 1988, 12–16.

    Google Scholar 

  4. Bezrukov S.L., Edge Isoperimetric Problems on Graphs, in: Graph Theory and Combinatorial Biology, Bolyai Soc. Math. Stud. 7, L. Lovasz, A. Gyarfas, G.O.H. Katona, A. Recski, L. Szekely eds., Budapest 1999, 157–197.

    Google Scholar 

  5. Bezrukov S.L., Das S., Elsässer R., An Edge-Isoperimetric Problem for Powers of the Petersen Graph, Annals of Combinatorics, 4 (2000), 153–169.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bollobás B., Leader I., Edge-isoperimetric Inequalities in the Grid, Combinatorica 11 (1991), 299–314.

    Article  MATH  MathSciNet  Google Scholar 

  7. Harper L.H., Optimal Assignment of Numbers to Vertices, J. Sos. Ind. Appl. Math. 12 (1964), 131–135.

    Article  MATH  MathSciNet  Google Scholar 

  8. Lindsey II J.H., Assignment of Numbers to Vertices, Amer. Math. Monthly 7 (1964), 508–516.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament of Math. and Comp. Sci., University of Wisconsin-Superior, USA

    Sergei L. Bezrukov

  2. Departament of Math. and Comp. Sci., University of Paderborn, Germany

    Robert Elsässer

Authors
  1. Sergei L. Bezrukov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Elsässer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bezrukov, S.L., Elsässer, R. (2001). Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation