𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Monophonic numbers of the join and composition of connected graphs

✍ Scribed by Esamel M. Paluga; Sergio R. Canoy; Jr

Book ID
108113723
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
217 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The rainbow connection number of 2-conne
The rainbow connection number of 2-connected graphs
✍ Ekstein, Jan; Holub, PΕ™emysl; Kaiser, TomΓ‘Ε‘; Koch, Maria; Camacho, Stephan Matos πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 426 KB
Circumferences of k-connected graphs inv
Circumferences of k-connected graphs involving independence numbers
✍ Guantao Chen; Zhiquan Hu; Yaping Wu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 211 KB πŸ‘ 1 views

Let G be a k-connected graph of order n, := (G) the independence number of G, and c(G) the circumference of G. ChvΓ‘tal and Erdo ˝s proved that if ≀ k then G is hamiltonian. For β‰₯ k β‰₯ 2, Fouquet and Jolivet in 1978 made the conjecture that c(G) β‰₯ k(n+ -k) / . Fournier proved that the conjecture is tr

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^nβˆ’2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp