✦ LIBER ✦

Trees with the same degree sequence and path numbers

✍ Scribed by Gary Gordon; Eleanor McDonnell

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 172 KB
Volume: 147
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00278-q

No coin nor oath required. For personal study only.

✦ Synopsis

We give an elementary procedure based on simple generating functions for constructing n (for any n >/2) pairwise non-isomorphic trees, all of which have the same degree sequence and the same number of paths of length k for all k >t 1. The construction can also be used to give a sufficient condition for isomorphism of caterpillars.

📜 SIMILAR VOLUMES

The 2-intersection number of paths and b

The 2-intersection number of paths and bounded-degree trees

✍ Michael S. Jacobson; André E. Kézdy; Douglas B. West 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

## Abstract We represent a graph by assigning each vertex a finite set such that vertices are adjacent if and only if the corresponding sets have at least two common elements. The __2‐intersection number__ θ~2~(__G__) of a graph __G__ is the minimum size of the union of sets in such a representatio

On the weighted trees with given degree

On the weighted trees with given degree sequence and positive weight set

✍ Shang-Wang Tan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Multiset Permutations and Loopless Gener

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

✍ James F. Korsh; Paul LaFollette 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An ordered tree with specified degree sequence and n internal nodes has a i Ž . nodes of degree i, where a s 1 q Ý i y 1 a and n s Ý a . This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for gener

The asymptotic number of labeled graphs

The asymptotic number of labeled graphs with given degree sequences

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Maximizing the number of independent sub

Maximizing the number of independent subsets over trees with bounded degree

✍ Clemens Heuberger; Stephan G Wagner 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has

The degree-preserving spanning tree prob

The degree-preserving spanning tree problem in strongly chordal and directed path graphs

✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ ε __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn