| A Proof of a Conjecture about Arithmetic Graph |
| Received:January 12, 1994 |
| Key Words:
arithmetic graph, cycle, conjecture.
|
| Fund Project: |
|
| Hits: 1832 |
| Download times: 1633 |
| Abstract: |
| A charya and Hedge proposed the conjecture: ( i) If a cycle C4t＋１ is (k , d )-arithmetic then k = 2dt+2r for some integer r ≥ 0.(ii) If a cycle C4t＋3 is (k , d ) -arithmetic then k = (2t + 1) d + 2r for some integer r ≥ 0. This conjecture is proved in this paper. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1996.04.022 |
| View Full Text View/Add Comment |
