首页 | 本学科首页   官方微博 | 高级检索  
     


Spanning trees whose reducible stems have a few branch vertices
Authors:Ha  Pham Hoang  Hanh   Dang Dinh  Loan   Nguyen Thanh  Pham   Ngoc Diep
Affiliation:1.Department of Mathematics, Hanoi National University of Education, 136 XuanThuy Str., Hanoi, Vietnam
;2.Department of Mathematics, Hanoi Architectural University, Km10 NguyenTrai Str., Hanoi, Vietnam
;3.Institute of Mathematics, Vietnam Academy of Science and Technology (VAST), Hanoi, Vietnam
;4.Nguyen Hue High School for Gifted Students, 560B QuangTrung Str., HaDong Distr., Hanoi, Vietnam
;
Abstract:Czechoslovak Mathematical Journal - Let T be a tree. Then a vertex of T with degree one is a leaf of T and a vertex of degree at least three is a branch vertex of T. The set of leaves of T is...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号