Coding and counting spanning trees in Kleitman-Golden graphs

Cybernetics ◽  
1991 ◽  
Vol 27 (3) ◽  
pp. 311-319
Author(s):  
L. M. Koganov
Keyword(s):  
Spanning Trees

Optimal ventcel graphs, minimal cost spanning trees and asymptotic probabilities

2007 ◽  
Vol 1 (1) ◽  
pp. 265-275 ◽  
Author(s):  
Chiang Tzuu-Shuh ◽  
Chow Yunshyong
Keyword(s):  
Spanning Trees ◽  
Minimal Cost

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness

scholarly journals The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yi-Cheng Yang ◽  
Shih-Shun Kao ◽  
Ralf Klasing ◽  
Sun-Yuan Hsieh ◽  
Hsin-Hung Chou ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Independent Spanning Trees

scholarly journals Fairest edge usage and minimum expected overlap for random spanning trees

2021 ◽  
Vol 344 (5) ◽  
pp. 112282
Author(s):  
Nathan Albin ◽  
Jason Clemens ◽  
Derek Hoare ◽  
Pietro Poggi-Corradini ◽  
Brandon Sit ◽  
...  
Keyword(s):  
Spanning Trees

scholarly journals A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees

2020 ◽  
Vol 16 (1) ◽  
pp. 1-27
Author(s):  
Gopal Pandurangan ◽  
Peter Robinson ◽  
Michele Scquizzato
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Spanning Trees

scholarly journals Properties of Commuting Graphs over Semidihedral Groups

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 103
Author(s):  
Tao Cheng ◽  
Matthias Dehmer ◽  
Frank Emmert-Streib ◽  
Yongtao Li ◽  
Weijun Liu
Keyword(s):  
Spanning Trees ◽  
Laplacian Spectrum ◽  
Vertex Connectivity ◽  
Laplacian Energy ◽  
Number Of Spanning Trees

This paper considers commuting graphs over the semidihedral group SD8n. We compute their eigenvalues and obtain that these commuting graphs are not hyperenergetic for odd n≥15 or even n≥2. We further compute the Laplacian spectrum, the Laplacian energy and the number of spanning trees of the commuting graphs over SD8n. We also discuss vertex connectivity, planarity, and minimum disconnecting sets of these graphs and prove that these commuting graphs are not Hamiltonian.

Sign in / Sign up

Export Citation Format

Share Document