Partial trees in weighted graphs-I

DOI10.4067/S0716-09172011000200003MaRDI QIDQ2891207zbMATH OpenOpenAlexFDO

Authors Sunil Mathew

Publication date 13 June 2012

Published in Proyecciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4067/s0716-09172011000200003

zbMATH Keywords

partial Bridgepartial treestrength of connectedness

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Maximum of k-th maximal spanning trees of a weighted graph
• scientific article; zbMATH DE number 1080078
• Arc analysis algorithm (AAA) for arc-weighted graphs
• Spanning trees and hierarchical networks
• On the construction of graphs with large numbers of spanning trees

Cited in

(6)

• Finding a minimal spanning hypertree of a weighted hypergraph
• Arc analysis algorithm (AAA) for arc-weighted graphs
• Statuses and branch-weights of weighted trees
• A characterization of partial blocks in weighted graphs
• Trees in many contexts
• On transit functions in weighted graphs

This page was built for publication: Partial trees in weighted graphs-I

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