1972/03/01 by J. A. Bondy · 2 citations
Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Advanced Graph Theory Research #Graph theory and applications #Mathematics #Notation #Combinatorics #Hamiltonian path #Graph #Hamiltonian (control theory) #Discrete mathematics #Arithmetic
paper · pdf · doi:10.4153/cmb-1972-012-3
openalex publication_date 1972/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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 .