Skip to main content
SpringerLink
Log in

On Some Properties of Doughnut Graphs

(Extended Abstract)

  • Conference paper
Combinatorial Algorithms (IWOCA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7643))

Included in the following conference series:

  • 834 Accesses

Abstract

The class doughnut graphs is a subclass of 5-connected planar graphs. It is known that a doughnut graph admits a straight-line grid drawing with linear area, the outerplanarity of a doughnut graph is 3, and a doughnut graph is k-partitionable. In this paper we show that a doughnut graph exhibits a recursive structure. We also give an efficient algorithm for finding a shortest path between any pair of vertices in a doughnut graph. We also propose a nice application of a doughnut graph based on its properties.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhuyan, L., Agarwal, D.P.: Generalized hypercube and hyperbus structure for a computer network. IEEE Trans. Comput. 33, 555–566 (1984)

    Article  Google Scholar 

  2. Karim, M.R., Rahman, M.S.: Straight-line grid drawings of planar graphs with linear area. In: Proceedings of Asia-Pacific Symposium on Visualisation 2007, pp. 109–112. IEEE (2007)

    Google Scholar 

  3. Karim, M.R., Rahman, M.S.: On a class of planar graphs with straight-line grid drawings on linear area. Journal of Graph Algorithms and Applications 13(2), 153–177 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Leighton, F.T.: Introduction to parallel algorithms and architectures: Arrays-trees-hypercubes. Morgan Kaufmann Publishers (1992)

    Google Scholar 

  5. Nahiduzaman, K.M., Karim, M.R., Rahman, M.S.: A linear-time algorithm for k-partitioning doughnut graphs. INFOCOMP 8(1), 8–13 (2009)

    Google Scholar 

  6. Preparata, F.P., Vuillemin, J.: The cube-connected-cycles: A versatile network for parallel computation. Communications of the ACM 24, 300–309 (1981)

    Article  MathSciNet  Google Scholar 

  7. Xu, J. (ed.): Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, University of Dhaka, Dhaka, 1000, Bangladesh

    Md. Rezaul Karim

  2. Dept. of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka, 1000, Bangladesh

    Md. Jawaherul Alam & Md. Saidur Rahman

Authors
  1. Md. Rezaul Karim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Md. Jawaherul Alam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Md. Saidur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kalasalingam University, Anand Nagar, 626 126, Krishanakoil, Tamil Nadu, India

    S. Arumugam

  2. Algorithms Research Group, Department of Computing & Software, McMaster University, L8S 4K1, Hamilton, ON, Canada

    W. F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karim, M.R., Alam, M.J., Rahman, M.S. (2012). On Some Properties of Doughnut Graphs. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35926-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35925-5

  • Online ISBN: 978-3-642-35926-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation