Abstract
As its name implies, this paper consists of observations on various topics in graph theory that stem from the concept of Hamiltonian cycle. We shall mainly adopt the notation and terminology of Harary [5]. However, we use vertices and edges for what are called "points" and "lines" in [5]. V(G), E(G) respectively will denote the sets of vertices and edges of graph G, and |X| will denote the cardinal of the set X.|V(G)| is the order of G, and |E(G)| the size of G. Throughout n is reserved for the order of G.
Publisher
Canadian Mathematical Society
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献