FORMULAS FOR NUMBER OF TREES IN CERTAIN INCOMPLETE GRAPHS

被引：6

作者：

BEDROSIA.SD

机构：

来源：

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS | 1970年 / 289卷 / 01期

关键词：

D O I：

10.1016/0016-0032(70)90261-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：67 / &

共 12 条

[1] GENERATING FORMULAS FOR NUMBER OF TREES IN GRAPH [J].

BEDROSIAN, SD .

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1964, 277 (04) :313-&

[2]

BEDROSIAN SD, 1961, IRE T CIRCUIT THEORY, VPGC8, P363

[3]

BEDROSIAN SD, 1964, 7 C REC MIDW S CIRC, P47

[4]

BERCOVICI M, 1969, IEEE T CIRCUIT THEOR, VCT13, P101

[5]

Cayley A., 1889, QUATERLY J MATH, V23, P376, DOI [10.1017/cbo9780511703799.010, DOI 10.1017/CBO9780511703799]

[6]

CAYLEY A, COLLECTED PAPERS, V13, P26

[7]

Kasai T, 1966, J I ELECT COMMUN ENG, V49, P69

[8]

MOON JW, 1967, GRAPH THEORY THEORET, pCH8

[9] IDENTIFICATION OF AN INCOMPLETELY PARTITIONED NETWORK [J].

ONEIL, PV ;

SLEPIAN, P .

[10]

ONEIL PV, 1966, IEEE T CIRCUIT THEOR, P270