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
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
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
## 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