Balanced graphs and network flows

DOI10.1002/(SICI)1097-0037(199703)29:2%3C77::AID-NET1%3E3.0.CO;2-8zbMATH Open0888.90146OpenAlexW2090778474MaRDI QIDQ4367274FDOQ4367274

S. G. Penrice

Publication date: 8 June 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2%3C77::aid-net1%3E3.0.co;2-8

Recommendations

• scientific article; zbMATH DE number 653269
• Characterizations of max-balanced flows
• scientific article

zbMATH Keywords

balanced graphslexicographic productedge-transitive graphscomplete \(m\)-partite graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (12)

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced loads in infinite networks
• Balanced and 1-balanced graph constructions
• Title not available (Why is that?)
• CFI Construction and Balanced Graphs
• Characterizations of max-balanced flows
• Title not available (Why is that?)
• \(w\)-density and \(w\)-balanced property of weighted graphs
• Balanced network flows. IV: Duality and structure theory.
• Maximum balanced flow in a network

This page was built for publication: Balanced graphs and network flows

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