Balanced graphs and network flows

DOI<77::AID-NET1>3.0.CO;2-8 10.1002/(SICI)1097-0037(199703)29:2<77::AID-NET1>3.0.CO;2-8zbMath0888.90146OpenAlexW2090778474MaRDI QIDQ4367274

S. G. Penrice

Publication date: 8 June 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2<77::aid-net1>3.0.co;2-8

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Balanced and 1-balanced graph constructions ⋮ \(w\)-density and \(w\)-balanced property of weighted graphs ⋮ Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees

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