Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A First Course in Graph Theory and CombinatoricsTrees

A First Course in Graph Theory and Combinatorics: Trees [A forest is an acyclic graph (that is, a graph with no cycles). The connected components of a forest are called trees. Therefore, a tree is a connected acyclic graph. In particular, any tree is a bipartite graph. A leaf is a vertex of degree one. In the figure below, we have a tree with seven leaves.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A First Course in Graph Theory and CombinatoricsTrees

Part of the Texts and Readings in Mathematics Book Series (volume 55)
Cioabă, Sebastian M.; Murty, M. Ram
Springer Journals — May 24, 2017
Download PDF
10 pages

Loading next page...
 
/lp/springer-journals/a-first-course-in-graph-theory-and-combinatorics-trees-N3lWQYRh6W
Publisher
Hindustan Book Agency
Copyright
© Hindustan Book Agency (India) 2009
ISBN
978-81-85931-98-2
Pages
41 –51
DOI
10.1007/978-93-86279-39-2_5
Publisher site
See Chapter on Publisher Site

Abstract

[A forest is an acyclic graph (that is, a graph with no cycles). The connected components of a forest are called trees. Therefore, a tree is a connected acyclic graph. In particular, any tree is a bipartite graph. A leaf is a vertex of degree one. In the figure below, we have a tree with seven leaves.]

Published: May 24, 2017

There are no references for this article.