PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 1, 1956Proceedings of the American Mathematical Society5,147 citationsOpen Access

On the shortest spanning subtree of a graph and the traveling salesman problem

JKJoseph B. Kruskal

Key Points

  • To investigate the relationship between the shortest spanning subtree of a graph and the traveling salesman problem.
  • Analysis of existing literature on graph theory and algebraic structures.
  • Examination of mathematical properties related to periodic groups and nil rings.
  • Discussion includes implications for the traveling salesman problem in the context of graph theory.
  • Identified connections between algebraic structures and spanning tree concepts.

Abstract

A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J. Levitzki, On the radical of a general ring, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 462⁶6. 9. -, On three problems concerning nil rings, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 913-919. 10. -, On the structure of algebraic algebras and related rings, Trans. Amer. Math. Soc. vol. 74 (1953) pp. 384-409.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Joseph B. Kruskal (1956) studied this question.

synapsesocial.com/papers/69e07cfc46ce12fc61557530https://doi.org/10.1090/s0002-9939-1956-0078686-7
Ask AI
Helpful
Bookmark
Share
View Full Paper