Exactly \(k\) MSTs: How many vertices suffice?

DOI10.1007/978-3-031-49611-0_7MaRDI QIDQ6606169

V. Sunitha, Anuj Tawari, Apratim Dutta, R. Muthu

Publication date: 16 September 2024

zbMATH Keywords

minimum spanning treeselementary symmetric polynomialsweighted complete graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• A new technique for the characterization of graphs with a maximum number of spanning trees
• On the characterization of graphs with maximum number of spanning trees
• Symmetric Determinantal Representation of Weakly-Skew Circuits
• Maximizing the number of spanning trees in a graph with n nodes and m edges
• Maximizing spanning trees in almost complete graphs
• On the Minimal Graph with a Given Number of Spanning Trees
• On the minimum number of vertices and edges in a graph with a given number of spanning trees

This page was built for publication: Exactly \(k\) MSTs: How many vertices suffice?

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