BOND GRAPHS .3. BOND GRAPHS AND ELECTRICAL NETWORKS

Citation
Jd. Lamb et al., BOND GRAPHS .3. BOND GRAPHS AND ELECTRICAL NETWORKS, Discrete applied mathematics, 73(3), 1997, pp. 211-250
Citations number
24
Categorie Soggetti
Mathematics,Mathematics
Volume
73
Issue
3
Year of publication
1997
Pages
211 - 250
Database
ISI
SICI code
Abstract
Electrical networks are defined and a definition of when a bond graph and an electrical network are equivalent is given. Bond graphs and ele ctrical networks are defined to be primitive if they contain no transf ormers or gyrators. A bond graph is defined to be realisable if it is equivalent to an electrical network and primitively realisable if it i s equivalent to a primitive electrical network. It is shown how to con struct a bond graph equivalent to a given electrical network and how t o construct an electrical network equivalent to a given bond graph. Ch ordless odd loops are defined and a characterisation of primitively re alisable bond graphs in terms of chordless odd loops and forbidden ind uced subgraphs is given. It is shown how to construct a primitive netw ork equivalent to a given primitively realisable bond graph.