Counting spanning trees in the graphs of Kleitman and Golden and a generalization

Rakesh Vohra, Lawrence C. Washington

Type: Article

Publication Date: 1984-11-01

Citations: 13

DOI: https://doi.org/10.1016/0016-0032(84)90054-1

View Publication

Locations

Journal of the Franklin Institute - View

Similar Works

Action	Title	Year	Authors
+	Coding and counting spanning trees in Kleitman-Golden graphs	1991	L. M. Koganov
+	Counting spanning trees of a type of generalized Farey graphs	2020	Jingyuan Zhang Weigen Yan
+	Counting spanning trees in directed regular multigraphs	1989	Jacek Wojciechowski Michael R. Fellows
+	Enumerating spanning trees of graphs with an involution	2008	Fuji Zhang Weigen Yan
+	Counting Minimum Weight Spanning Trees	1997	Andrei Broder Ernst Mayr
+	Generating functions and counting formulas for spanning trees and forests in hypergraphs	2024	Jiuqiang Liu Shenggui Zhang Guihai Yu
+	An efficient approach for counting the number of spanning trees in circulant and related graphs	2009	Talip Atajan Xuerong Yong Hiroshi Inaba
+ PDF Chat	A note on the number of spanning trees of a graph	1966	Iva Rohlíčková
+	Counting spanning trees in almost complete multipartite graphs	2022	Sujing Cheng Wu‐Xian Chen Weigen Yan
+ PDF Chat	Counting trees in a graph	2018	Anton Petrunin
+	A correction in the formula for the number of spanning trees in threshold graphs.	2007	Sarah K. Bleiler John T. Saccoman
+	Counting graphs	2025	Miklós Bóna
+	Counting Spanning Trees in Cographs	2003	Stavros D. Nikolopoulos Charis Papadopoulos
+	Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph	2012	Haruhide Matsuda Kenta Ozeki Tomoki Yamashita
+	A New Proof of Cayleyʼs Formula for Labeled Spanning Trees	2014	M. Ariannejad Mojgan Emami
+	Extending the Greene-Kleitman theorem to directed graphs	1981	Nathan Linial
+	Generating formulas of the number of spanning trees of some special graphs	2014	S. N. Daoud
+ PDF Chat	Maximizing the number of spanning trees in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si43.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-complements of asteroidal graphs	2008	Stavros D. Nikolopoulos Leonidas Palios Charis Papadopoulos
+	Spanning trees of descendants of a complete graph	2022	Derya Asaner Sayonita Ghosh Hajra Maryam Siddique
+	Degree sums and spanning brooms of a graph	2022	Yueyu Wu Yunqing Zhang Yaojun Chen

Works That Cite This (13)

Action	Title	Year	Authors
+	None	2008	Min Lü Chao Wu Guoliang Chen LV Cheng
+ PDF Chat	The number of spanning trees in a class of double fixed‐step loop networks	2008	Xuerong Yong Yuanping Zhang Mordecai J. Golin
+	Counting spanning trees in directed regular multigraphs	1989	Jacek Wojciechowski Michael R. Fellows
+	Counting the number of spanning trees in a class of double fixed-step loop networks	2009	Talip Atajan Naohisa Otsuka Xuerong Yong
+	Coding and counting spanning trees in Kleitman-Golden graphs	1991	L. M. Koganov
+	The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks (Extended Abstract)	2009	Talip Atajan Naohisa Otsuka Xuerong Yong
+	The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)	2007	Mordecai J. Golin Xuerong Yong Yuanping Zhang
+	An efficient approach for counting the number of spanning trees in circulant and related graphs	2009	Talip Atajan Xuerong Yong Hiroshi Inaba
+	The spanning trees formulas in a class of double fixed-step loop networks	2009	Talip Atajan Naohisa Otsuka Xuerong Yong
+	The asymptotic number of spanning trees in circulant graphs	2007	Mordecai J. Golin Xuerong Yong Yuanping Zhang

Works Cited by This (0)

Action	Title	Year	Authors