MAXIMIZING THE NUMBER OF SPANNING-TREES ON THE (P,P+2) GRAPHS

被引：2
|
作者：
WU, MH
机构：
[1] Department of Computer Center, Chia-Nan Junior College of Pharmacy, Tainan
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 32卷 / 1-2期
关键词：
(p; cut point; p + 2) block; spanning tree;
D O I：
10.1080/00207169008803812
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This paper considers the problem of maximizing the number of spanning trees. A newly established result is the formula and the graph topology for the maximum number of spanning trees among the class of (p,p+2) graph. © 1990 Gordon and Breach, Science Publishers, Inc.
引用
收藏
页码：27 / 38
页数：12
相关论文
共 50 条
12345