𝔖 Bobbio Scriptorium
✦   LIBER   ✦

GRAPH CONNECTIVITY ALGORITHM

✍ Scribed by Joseph B. Frechen


Book ID
114879175
Publisher
John Wiley and Sons
Year
1970
Tongue
English
Weight
452 KB
Volume
175
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graph Theory with Algorithms and its App
✍ Saha Ray, Santanu (author) πŸ“‚ Article πŸ“… 2012 πŸ› Springer India 🌐 Hindi βš– 427 KB

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers

Graph Theory with Algorithms and its App
✍ Saha Ray, Santanu (author) πŸ“‚ Article πŸ“… 2012 πŸ› Springer India 🌐 Hindi βš– 427 KB

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers

Graphs with prescribed connectivity and
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract Chartrand and Stewart have shown that the line graph of an __n__‐connected graph is itself __n__‐connected. This paper shows that for every pair of integers __m__ > __n__ > 1 there is a graph of point connectivity __n__ whose line graph has point connectivity __m__. The corresponding qu