Premium
Hamiltonian path graphs
Author(s) -
Chartrand Gary,
Kapoor S. F.,
Nordhaus E. A.
Publication year - 1983
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190070406
Subject(s) - combinatorics , mathematics , hamiltonian path problem , hamiltonian path , longest path problem , discrete mathematics , pancyclic graph , hamiltonian (control theory) , vertex (graph theory) , indifference graph , graph , pathwidth , chordal graph , line graph , mathematical optimization
The Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u‐v path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonian path graphs is presented.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom