✦ LIBER ✦

On the number of induced subgraphs of trees

✍ Scribed by J.W. Moon

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 416 KB
Volume: 167-168
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00250-6

No coin nor oath required. For personal study only.

✦ Synopsis

used generating functions to obtain explicit formulas for the number of induced subgraphs with components of given sizes contained in trees T~ belonging to three particular families of trees. Using a different approach, we derive a more general result that contains their formulas as special cases.

📜 SIMILAR VOLUMES

On subgraph number independence in trees

✍ R.L Graham; E Szemerédi 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 428 KB

On induced subgraphs of trees, with rest

On induced subgraphs of trees, with restricted degrees

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 313 KB

On the number of distinct induced subgra

On the number of distinct induced subgraphs of a graph

✍ P. Erdős; A. Hajnal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the number of induced subgraphs of a

On the number of induced subgraphs of a random graph

✍ Hiroshi Maehara 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Cyclomatic numbers of connected induced

Cyclomatic numbers of connected induced subgraphs

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 509 KB

We give an upper bound for w(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for w(A) when G is triangle-free. We show that these two bounds are best possible. Similar results are obtai

On the number of unique subgraphs

✍ Frank Harary; Allen J Schwenk 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 199 KB