Vidyasagar, M. (1970) An algebraic method for finding a dual graph of a given graph IEEE Transactions on Circuit Theory, 17 (3). pp. 434-436. ISSN 0018-9324
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...
Related URL: http://dx.doi.org/10.1109/TCT.1970.1083140
Abstract
This correspondence presents a theorem that relates the tree matrix of a graph to the existence of a dual graph (planarity). Using this theorem, a purely algebraic procedure is formulated for finding a dual graph of a given graph, and a test for the planarity of a graph can also be developed. The planarity test is of theoretical interest but appears to be more complicated than known methods.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to IEEE. |
| ID Code: | 56116 |
| Deposited On: | 22 Aug 2011 12:27 |
| Last Modified: | 22 Aug 2011 12:27 |
Repository Staff Only: item control page
