✦ LIBER ✦

Tree graphs and tree numbers

✍ Scribed by Krishnamoorthy, M.; Deo, N.

Book ID: 117913589
Publisher: IEEE
Year: 1975
Weight: 390 KB
Volume: 22
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1975.1083957

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rank numbers for some trees and unicycli

Rank numbers for some trees and unicyclic graphs

✍ Emily Sergel; Peter Richter; Anh Tran; Patrick Curran; Jobby Jacob; Darren A. Na 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 272 KB

Extremal theory and bipartite graph-tree

Extremal theory and bipartite graph-tree Ramsey numbers

✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II

Jumping numbers and ordered tree structu

Jumping numbers and ordered tree structures on the dual graph

✍ Eero Hyry; Tarmo Järvilehto 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 266 KB

A certain polynomial of a graph and grap

A certain polynomial of a graph and graphs with an extremal number of trees

✍ A.K Kelmans; V.M Chelnokov 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 760 KB

The number of spanning trees in an (r, s

The number of spanning trees in an (r, s)-semiregular graph and its line graph

✍ Khodakhast Bibak 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

Transformations of a Graph Increasing it

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees

✍ A.K. Kelmans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB