Construction of Completely Independent Spanning Tree Based on Vertex Degree

2021 ◽  
pp. 94-103
Author(s):  
Ningning Liu ◽  
Yujie Zhang ◽  
Weibei Fan
Keyword(s):  
Spanning Tree ◽  
Vertex Degree

scholarly journals An algorithm for solving minimum edge-ranking spanning tree problem on partial k-trees

1970 ◽  
Vol 4 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Razia Sultana
Keyword(s):  
Spanning Tree ◽  
Science And Technology ◽  
Vertex Degree ◽  
International University ◽  
Positive Integers

An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges with the same label i contains an intermediate edge with label j>i. The minimum edge-ranking spanning tree problem is to find a spanning tree of a graph G whose edge-ranking needs least number of ranks. In this paper, we present an algorithm to solve the minimum edge-ranking spanning tree problem on a partial k-tree G in O(n2Δ(k+1)+2 Δk(k+1)+2 log2 k(k+1)+2n) time, where n is the number of vertices, Δ is the maximum vertex degree of the graph G and k is bounded by a constant value. Keywords: Algorithm, partial k-trees, edge-ranking, spanning tree. DOI: 10.3329/diujst.v4i1.4347 Daffodil International University Journal of Science and Technology Vol.4(1) 2009 pp.1-8

Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure

2009 ◽  
Vol E92-B (3) ◽  
pp. 909-921
Author(s):  
Depeng JIN ◽  
Wentao CHEN ◽  
Li SU ◽  
Yong LI ◽  
Lieguang ZENG
Keyword(s):  
Spanning Tree ◽  
Recovery Scheme

Is there a Condorcet Spanning Tree?

2014 ◽  
Author(s):  
Andreas Darmann
Keyword(s):  
Spanning Tree
Sign in / Sign up

Export Citation Format

Share Document