On Some Properties of Doughnut Graphs
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 7.Xu, J. (ed.): Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers (2001)Google Scholar