Spanning tree of a multiple graph

DOI10.1007/S10878-021-00810-5MaRDI QIDQ2136168zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 10 May 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00810-5

zbMATH Keywords

minimum spanning treespanning treemultiple graphcomplete spanning treemultiple tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• On the number of spanning trees in graphs with multiple edges
• On the number of spanning trees of a multi-complete/star related graph
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• Multitrees in random graphs
• scientific article; zbMATH DE number 932184

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Introduction to algorithms.
• Metagraphs and their applications.
• On the shortest spanning subtree of a graph and the traveling salesman problem

Cited in

(8)

• How to use spanning trees to navigate in graphs
• scientific article; zbMATH DE number 6101315 (Why is no real title available?)
• Multitrees in random graphs
• The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph
• Spanning trees in multipartite geometric graphs
• scientific article; zbMATH DE number 3987333 (Why is no real title available?)
• The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
• On the number of spanning trees in graphs with multiple edges

This page was built for publication: Spanning tree of a multiple graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136168)