✦ LIBER ✦

Laplacian coefficients of trees with given number of leaves or vertices of degree two

✍ Scribed by Aleksandar Ilić; Milovan Ilić

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 255 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.07.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Laplacian coefficients of trees with a g

Laplacian coefficients of trees with a given bipartition

✍ Weiqi Lin; Weigen Yan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 658 KB

Laplacian spectral radius of trees with

Laplacian spectral radius of trees with given maximum degree

✍ Aimei Yu; Mei Lu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Enumeration of digraphs with given numbe

Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree

✍ Shinsei Tazawa; Teruhiro Shirakura; Saburo Tamura 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 609 KB

## Tazawa, S., T. Shirakura and S. Tamura, Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree, Discrete Mathematics 90 (1991) 63-74. In a digraph, a vertex of odd out(in)-degree is called an odd out(in)-vertex. This paper will give the ordinary g

Ordering of trees with fixed matching nu

Ordering of trees with fixed matching number by the Laplacian coefficients

✍ Shushan He; Shuchao Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 448 KB

A spanning tree of the 2m-dimensional hy

A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices

✍ Sul-young Choi; Puhua Guan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 190 KB

For an n-dimensional hypercube Q., the maximum number of degree-preserving vertices in a spanning tree is 2"jn if n = 2" for an integer M. (If n # 2", then the maximum number of degree-preserving vertices in a spanning tree is less than 2"/n.) We also construct a spanning tree of Qzm with maximum nu

The ally-reconstruction number of a tree

The ally-reconstruction number of a tree with five or more vertices is three

✍ Wendy Myrvold 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 788 KB

## Abstract The __ally‐reconstruction number__ of a graph __G__, ally‐rn(__G__), is the minimum number of vertex‐deleted subgraphs required in order to identify __G__ up to isomorphism. In this paper, we show that ally‐rn(__T__) = 3 for any tree __T__ with five or more vertices.