Alexander polynomial and spanning trees

被引：0

作者：

Bao, Yuanyuan ^{[1
]}

Wu, Zhongtao ^{[2
]}

机构：

[1] Univ Tokyo, Grad Sch Math Sci, 3-8-1 Komaba, Tokyo 1538914, Japan

[2] Chinese Univ Hong Kong, Dept Math, Shatin, Hong Kong, Peoples R China

来源：

INTERNATIONAL JOURNAL OF MATHEMATICS | 2021年 / 32卷 / 08期

关键词：

Alexander polynomial; MOY graph; weighted number; spanning tree;

D O I：

10.1142/S0129167X21500737

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Inspired by the combinatorial constructions in earlier work of the authors that generalized the classical Alexander polynomial to a large class of spatial graphs with a balanced weight on edges, we show that the value of the Alexander polynomial evaluated at t = 1 gives the weighted number of the spanning trees of the graph.

引用

页数：15

共 50 条

[1] Milnor numbers, spanning trees, and the Alexander-Conway polynomial
Masbaum, G
Vaintrob, A
[J]. ADVANCES IN MATHEMATICS, 2003, 180 (02) : 765 - 797
[2] Laplacian Polynomial and Number of Spanning Trees in Terms of Characteristic Polynomial of Induced Subgraphs
Walikar, H.
Ramane, H.
[J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2008, 5 (01) : 47 - 55
[3] Transformations of a graph increasing its laplacian polynomial and number of spanning trees
Kelmans, AK
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1997, 18 (01) : 35 - 48
[4] CALCULATING THE CHARACTERISTIC POLYNOMIAL, EIGENVECTORS AND NUMBER OF SPANNING-TREES OF A HEXAGONAL SYSTEM
JOHN, P
SACHS, H
[J]. JOURNAL OF THE CHEMICAL SOCIETY-FARADAY TRANSACTIONS, 1990, 86 (07): : 1033 - 1039
[5] A polynomial-time approximation scheme for minimum routing cost spanning trees
Wu, BY
Lancia, G
Bafna, V
Chao, KM
Ravi, R
Tang, CAY
[J]. SIAM JOURNAL ON COMPUTING, 2000, 29 (03) : 761 - 778
[6] The taut polynomial and the Alexander polynomial
Parlak, Anna
[J]. JOURNAL OF TOPOLOGY, 2023, 16 (02) : 720 - 756
[7] ON THE ALEXANDER POLYNOMIAL
TORRES, G
[J]. ANNALS OF MATHEMATICS, 1953, 57 (01) : 57 - 89
[8] SPANNING TREES
不详
[J]. JOURNAL OF HUMANISTIC MATHEMATICS, 2021, 11 (02): : 481 - 482
[9] Spanning Trees
Akiyama, Jin
Kano, Mikio
[J]. FACTORS AND FACTORIZATIONS OF GRAPHS: PROOF TECHNIQUES IN FACTOR THEORY, 2011, 2031 : 295 - 336
[10] A polynomial time approximation scheme for optimal product-requirement communication spanning trees
Wu, BY
Chao, KM
Tang, CY
[J]. JOURNAL OF ALGORITHMS, 2000, 36 (02) : 182 - 204

← 1 2 3 4 5 →