Document Type
Lecture
Publication Date
4-3-2013
Abstract
Much of what is known about trees extends smoothly to k-trees. Some fairly recent results of this type, concerning independence polynomials, will be presented. We discuss the shell of a k-tree, corresponding to the line graph of a tree, and some steps are taken toward a possible characterization of shells. A new class of graphs, the k-frames will be de ned, generalizing the k-trees. In each of these classes of graphs, the problem of characterizing the well-covered graphs will be discussed. This is joint work with John Estes, Wanda Payne, Lanzhen Song , Bing Wei and others.
Relational Format
presentation
Recommended Citation
Staton, William, "k-Trees, k-Frames, Shells and Independence Polynomials" (2013). Combinatorics Seminar. 57.
https://egrove.olemiss.edu/math_combinatorics/57
