Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646487 | AKCE International Journal of Graphs and Combinatorics | 2016 | 10 Pages |
Abstract
The class of 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 kk-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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman,