Loading...
Please wait, while we are loading the content...
Similar Documents
Detection of Hamiltonian circuits in a directed graph
| Content Provider | Scilit |
|---|---|
| Author | Karmakar, Sudhangshu B. |
| Copyright Year | 1982 |
| Description | A simple algebraic method is presented to determine the necessary condition for the existence of a Hamiltonian circuit in a directed graph of n vertices. A search procedure is then introduced to identify any or all of the existing Hamiltonian circuits. The procedure is based upon finding a set of edges which will then be candidates for being parts of circuits of length n at any vertex of the graph. |
| Related Links | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB2DA61F672269069A9C4A5C86A51DE7/S0334270000003702a.pdf/div-class-title-detection-of-hamiltonian-circuits-in-a-directed-graph-div.pdf |
| Ending Page | 242 |
| Page Count | 9 |
| Starting Page | 234 |
| ISSN | 03342700 |
| e-ISSN | 18394078 |
| DOI | 10.1017/s0334270000003702 |
| Journal | The Journal of the Australian Mathematical Society. Series B. Applied Mathematics |
| Issue Number | 2 |
| Volume Number | 24 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 1982-10-01 |
| Access Restriction | Open |
| Subject Keyword | The Journal of the Australian Mathematical Society. Series B. Applied Mathematics Applied Mathematics Directed Graph |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics |