A short algorithm to delete singular junctions in bond graphs

DOI10.1016/0016-0032(95)00086-0zbMath0850.93077OpenAlexW2087058455MaRDI QIDQ1916935

John D. Lamb

Publication date: 21 August 1996

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(95)00086-0

Mathematics Subject Classification ID

Related Items (3)

A short algorithm to delete singular junctions in bond graphs ⋮ An identity involving 3-regular graphs ⋮ Bond graphs. III: Bond graphs and electrical networks

Cites Work

• Bond graphs. I: Acausal equivalence
• Bond graphs. II: Causality and singularity
• A short algorithm to delete singular junctions in bond graphs
• The Properties of Bond Graph Junction Structure Matrices
• Paths, Trees, and Flowers

This page was built for publication: A short algorithm to delete singular junctions in bond graphs