Duality in Networks: Roses, Bouquets, and Cut‐Sets; Trees, Forests and Polygons
From MaRDI portal
Publication:4111312
DOI10.1002/net.1975.5.2.179zbMath0343.90051OpenAlexW2767410383MaRDI QIDQ4111312
No author found.
Publication date: 1975
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.1975.5.2.179
Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (5)
The analysis of Lagrangian and Hamiltonian properties of the classical relativistic electrodynamics models and their quantization ⋮ The relativistic electrodynamics least action principles revisited: new charged point particle and hadronic string models analysis ⋮ Matroids, generalized networks, and electric network synthesis ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Spontaneously broken symmetries in gravitational fields
This page was built for publication: Duality in Networks: Roses, Bouquets, and Cut‐Sets; Trees, Forests and Polygons
