On minimum walks in graphs

Stephen Hedetniemi

Naval Research Logistics Quarterly, 1968, vol. 15, issue 3, 453-458

Abstract: In this paper homomorphisms are used to define four new parameters of a graph, which have to do with minimum walks in graphs satisfying certain conditions. Several bounds and exact equations are obtained for two of these parameters; a third parameter is seen to be closely related to the Traveling Salesman Problem and the question of whether a given graph is Hamiltonian.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800150309

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:15:y:1968:i:3:p:453-458

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().