Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The connectivities of adjacent tree graphs

The connectivities of adjacent tree graphs The connectivity and the circuit rank of a graphG are denoted byx(G) andρ, respectively. It is shown that ifH is the adjacent tree graph of a simple connected graphG, thenx(H)=2ρ. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

The connectivities of adjacent tree graphs

Acta Mathematicae Applicatae Sinica , Volume 3 (4) – Jul 13, 2005

Loading next page...
 
/lp/springer-journals/the-connectivities-of-adjacent-tree-graphs-cWmtOl3Tru
Publisher
Springer Journals
Copyright
Copyright © 1987 by Science Press, Beijing, China and Allerton Press, Inc. New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02008369
Publisher site
See Article on Publisher Site

Abstract

The connectivity and the circuit rank of a graphG are denoted byx(G) andρ, respectively. It is shown that ifH is the adjacent tree graph of a simple connected graphG, thenx(H)=2ρ.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

References