Jump to ContentJump to Main Navigation
The Fascinating World of Graph Theory$
Users without a subscription are not able to see the full content.

Ping Zhang, Gary Chartrand, and Arthur Benjamin

Print publication date: 2017

Print ISBN-13: 9780691175638

Published to Princeton Scholarship Online: May 2018

DOI: 10.23943/princeton/9780691175638.001.0001

Show Summary Details
Page of

PRINTED FROM PRINCETON SCHOLARSHIP ONLINE (www.princeton.universitypressscholarship.com). (c) Copyright Princeton University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in PRSO for personal use.date: 04 June 2020

Constructing Trees

Constructing Trees

Chapter:
(p.67) 4 Constructing Trees
Source:
The Fascinating World of Graph Theory
Author(s):

Arthur Benjamin

Gary Chartrand

Ping Zhang

Publisher:
Princeton University Press
DOI:10.23943/princeton/9780691175638.003.0004

This chapter considers a class of graphs called trees and their construction. Trees are connected graphs containing no cycles. When dealing with trees, a vertex of degree 1 is called a leaf rather than an end-vertex. The chapter first provides an overview of trees and their leaves, along with the relevant theorems, before discussing a tree-counting problem, introduced by British mathematician Arthur Cayley, involving saturated hydrocarbons. It shows that counting the number of saturated hydrocarbons is the same as counting the number of certain kinds of nonisomorphic trees. It then revisits another Cayley problem, one that involved counting labeled trees, and describes Cayley's Tree Formula and the corresponding proof known as the Prüfer code. It also explores decision trees and concludes by looking at the Minimum Spanning Tree Problem and its solution, Kruskal's Algorithm.

Keywords:   graph, tree, connected graph, leaf, Arthur Cayley, Cayley's Tree Formula, Prüfer code, decision tree, Minimum Spanning Tree Problem, Kruskal's Algorithm

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.