Balanced vertex weightings and arborescences

DOI10.1016/0095-8956(87)90046-3zbMath0654.05040OpenAlexW1971892699MaRDI QIDQ1108289

Kenneth A. Berman

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90046-3

zbMATH Keywords

digraphAbelian groupweightingarborescence numbersbalanced vertex weightingsTutte's trinity theorem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (1)

Generalized bicycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicycles and Spanning Trees
• Rotors in Graph Theory
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• On the Principal Edge Tripartition of a Graph
• Leaky Electricity: 1-Chain Formulas for the Current and Voltage
• A Proof of Tuite’s Trinity Theorem and a New Determinant Formula
• On Vector Spaces Associated with a Graph
• Graph property recognition machines

This page was built for publication: Balanced vertex weightings and arborescences