✦ LIBER ✦

On the number of unique subgraphs

✍ Scribed by Frank Harary; Allen J Schwenk

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 199 KB
Volume: 15
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90015-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of unique subgraphs of a g

On the number of unique subgraphs of a graph

✍ A.E Brouwer 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 107 KB

On graphs with unique subgraphs

✍ Madhukar G Deshpande 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Bounds on the number of complete subgrap

Bounds on the number of complete subgraphs

✍ David C. Fisher; Jennifer Ryan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

Handle bases and bounds on the number of

Handle bases and bounds on the number of subgraphs

✍ John Donald; John Elwin; Richard Hager; Peter Salamon 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 788 KB

On subgraph number independence in trees

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

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal