Loading...

Necessary and sufficient conditions for unit graphs to be Hamiltonian

Maimani, H. R ; Sharif University of Technology | 2011

266 Viewed
  1. Type of Document: Article
  2. DOI: 10.2140/pjm.2011.249.419
  3. Publisher: 2011
  4. Abstract:
  5. The unit graph corresponding to an associative ring R is the graph obtained by setting all the elements of R to be the vertices and defining distinct vertices x and y to be adjacent if and only if x + y is a unit of R. By a constructive method, we derive necessary and sufficient conditions for unit graphs to be Hamiltonian
  6. Keywords:
  7. Finite ring ; Hamiltonian cycle ; Hamiltonian graph
  8. Source: Pacific Journal of Mathematics ; Volume 249, Issue 2 , February , 2011 , Pages 419-429 ; 00308730 (ISSN)
  9. URL: http://msp.org/pjm/2011/249-2/p10.xhtml