✦ LIBER ✦

The number of DFAs for a given spanning tree

✍ Scribed by P. Babaali, E. Carta-Gerardino, C. Knaplund

Book ID: 120780501
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 549 KB
Volume: 65
Category: Article
ISSN: 0920-8542
DOI: 10.1007/s11227-013-0957-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of spanning trees of a graph

✍ Jianxi Li; Wai Chee Shiu; An Chang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 387 KB

In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.

The number of spanning trees of a graph

✍ Kinkar C Das,Ahmet S Cevik,Ismail N Cangul 📂 Article 📅 2013 🏛 Hindawi Publishing Corporation 🌐 English ⚖ 207 KB

The independence number condition for th

The independence number condition for the existence of a spanning f-tree

✍ Hikoe Enomoto; Kenta Ozeki 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

## Abstract Let __G__ be a graph and __f__ be a mapping from __V__(__G__) to the positive integers. A subgraph __T__ of __G__ is called an __f__‐tree if __T__ forms a tree and __d__~__T__~(__x__)≤__f__(__x__) for any __x__∈__V__(__T__). We propose a conjecture on the existence of a spanning __f__‐t

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

Number of spanning trees in a wheel

✍ Myers, B. 📂 Article 📅 1971 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 334 KB

Minimal trees of a given search number

✍ P. A. Golovach 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 374 KB