Skip to main content

On Rewriting of Planar 3-Regular Graphs

  • Conference paper
Informatics Engineering and Information Science (ICIEIS 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 253))

  • 1395 Accesses

Abstract

In this paper, we consider a class of connected planar 3-regular graphs (rotation systems) and show that, for any two such graphs with the same number of vertices, one kind of local rewriting rule is capable of rewriting one graph to the other. On the basis of such graph development systems, emergent systems including self-organizing systems will be considered in a uniform manner.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bolognesi, T.: Planar Trivalent Network Computation. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 146–157. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Diestel, R.: Graph Theory, 4th edn. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  3. Greenlaw, R., Petreschi, R.: Cubic graphs. ACM Computing Surveys 27(4), 471–495 (1995)

    Article  Google Scholar 

  4. Gross, T., Sayama, H. (eds.): Adaptive Networks: Theory. Models and Applications. Springer, Heidelberg (2009)

    Google Scholar 

  5. Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press (2009)

    Google Scholar 

  6. Rozenberg, R. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific (1997)

    Google Scholar 

  7. Tomita, K., Kurokawa, H., Murata, S.: Graph automata: natural expression of self-reproduction. Physica D 171(4), 197–210 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Tomita, K., Kurokawa, H.: On the reachability of a version of graph-rewriting system. Information Processing Letters 109(14), 777–782 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. von Neumann, J.: Theory of Self-Reproducing Automata. Univ. of Illinois Press (1966)

    Google Scholar 

  10. Wolfram, S.: A New Kind of Science. Wolfram Media (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomita, K., Ikeda, Y., Hosono, C. (2011). On Rewriting of Planar 3-Regular Graphs. In: Abd Manaf, A., Sahibuddin, S., Ahmad, R., Mohd Daud, S., El-Qawasmeh, E. (eds) Informatics Engineering and Information Science. ICIEIS 2011. Communications in Computer and Information Science, vol 253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25462-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25462-8_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25461-1

  • Online ISBN: 978-3-642-25462-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics