ON THE NUMBER OF SPANNING-TREES OF KN AND KM,N

被引：5

作者：

ABUSBEIH, MZ

机构：

[1] King Fahd University of Petroleum and Minerals

来源：

DISCRETE MATHEMATICS | 1990年 / 84卷 / 02期

关键词：

D O I：

10.1016/0012-365X(90)90377-T

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The object of this paper is to introduce a new technique for showing that the number of labelled spanning trees of the complete bipartite graph Km, n is |T(m, n)| = mn - 1nm - 1. As an application, we use this technique to give a new proof of Cayley's formula |T(n)| = nn - 2, for the number of labelled spanning trees of the complete graph Kn. © 1990.

引用

页码：205 / 207

页数：3