On weighted component edge connectivity of trees and unicycles

zbMATH Open1218.05078MaRDI QIDQ2995157FDOQ2995157

Lakshmi Iswara Chandra, Daniel J. Gross, Charles L. Suffel, L. William Kazmierczak, Antonius Suhartomo, John T. Saccoman

Publication date: 20 April 2011

Recommendations

• scientific article; zbMATH DE number 6000778
• Heavy cycles and spanning trees with few leaves in weighted graphs
• Partitioning a weighted tree into subtrees with weights in a given range
• Graph-Theoretic Concepts in Computer Science
• Cycles in weighted graphs

zbMATH Keywords

treesalgorithmunicyclesinteger weightweighted component edge connectivity

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Connectivity (05C40)

Cited In (3)

• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend
• Title not available (Why is that?)
• Connectedness of the free uniform spanning forest as a function of edge weights

This page was built for publication: On weighted component edge connectivity of trees and unicycles

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