𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing trees with given eigenvalues and angles

✍ Scribed by Dragoš Cvetković

Book ID
103258423
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
442 KB
Volume
105
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trees with very few eigenvalues
Trees with very few eigenvalues
✍ Robert A. Beezer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## Abstract The number of distinct eigenvalues of the adjacency matrix of a graph is bounded below by the diameter of the graph plus one. Many graphs that achieve this lower bound exhibit much symmetry, for example, distance‐transitive and distance‐regular graphs. Here we provide a recursive constr

Constructing trees in graphs with no K2,
Constructing trees in graphs with no K2,s
✍ Suman Balasubramanian; Edward Dobson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract Let __s__ ≥ 2 be an integer and __k__ > 12(__s__ − 1) an integer. We give a necessary and sufficient condition for a graph __G__ containing no __K__~2,__s__~ with $\delta(G)\ge{k}/2$ and $\Delta(G)\ge k$ to contain every tree __T__ of order __k__ + 1. We then show that every graph __G__

The enumeration of trees with and withou
The enumeration of trees with and without given limbs
✍ Taojun Lu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 720 KB

A limb of a tree is the union of one or more branches at a vertex in the tree, where a branch of a tree at a vertex is a maximal subtree containing the given vertex as an end-vertex. In this note, we first consider the enumeration of trees (undirected, oriented or mixed) with forbidden limbs. The en

Algorithms for constructing graphs and d
Algorithms for constructing graphs and digraphs with given valences and factors
✍ D.J. Kleitman; D.L. Wang 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 942 KB

Given a set of valences ( ui) such that { ui> and (vi-k} are both realizable as valences of graphs without loops or multiple edges, an explicit conslruction method is described for obtaining a graph with valences {ui] having a k-factor. A number of extensions of the result are obtained. Similar resu