๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Algebraic Relationships of Trees, Co-Trees, Circuits, and Cutsets of a Graph

โœ Scribed by Wai-Kai Chen; Mark, S.-K.


Book ID
111963944
Publisher
Institute of Electrical and Electronics Engineers
Year
1969
Tongue
English
Weight
944 KB
Volume
16
Category
Article
ISSN
0018-9324

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Packing the Steiner trees of a graph
โœ L. Petingi; M. Talafha ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB
The ordering of trees and connected grap
โœ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with ฮฑ(P n ) < ฮฑ(Q n ) < ฮฑ(W n ) < ฮฑ(Z n ) < ฮฑ(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L

On the Tree Graph of a Matroid
โœ Holzmann, Carlos A.; Harary, Frank ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 687 KB
On the Tree Graph of a Matroid
โœ Carlos A. Holzmann and Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 561 KB