In this paper we introduce the use of bond graphs for the implementation of classic physical models of musical instruments. Bond graphs are a diagram-based technique for representing physical systems, such as an electrical circuit or a mechanical engine. They provide a precise and unambiguous modelling tool which allows for the specification of hierarchical physical structures. The paper begins...

This paper introduces a new class of Bond Graph models, called Quantized Bond Graphs (QBG), which can be “exactly” simulated by a Discrete Event System Specification or DEVS structure (Zeigler; 1976, 2000). Standard Bond Graph representing Physical Systems can be approximated by QBG for the purpose of simulation. It is shown that derivative causalities dissapear from this kind of models, turnin...

The Atom-bond-connectivity index ABC of a graph G is determined by d_i and d_j. In this paper, sharp results for the general which has chemical applications are found using different methods. These new inex investigated in terms its edges, vertices degrees. particular, some relations obtained involving topological indices; Randic index, Zagreb Harmonic Narumi-Katayama index. Indeed, improved he...

Bond graphs are a domain-independent graphical description of dynamic behaviour of physical systems. This means that systems from different domains (cf. electrical, mechanical, hydraulical, acoustical, thermodymanical, material) are described in the same way. The basis is that bond graphs are based on energy and energy exchange. Analogies between domains are more than just equations being analo...

We explicitly construct an uncountable class of infinite aperiodic plane graphs which have equal, and explicitly computable, bond percolation thresholds. Furthermore for both bond percolation and the random-cluster model all large scale properties, such as the values of the percolation threshold and the critical exponents, of the graphs are equal. This equivalence holds for all values of p and ...

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...

Bicausal bond graphs are used to investigate the controllability of systems in terms of the properties of the bond graph of the inverse system.

In this paper, we deal with restoring missing information in molecule databases: Many data formats only store the atoms’ configuration but omit bond multiplicities. As this information is essential for various applications in chemistry, we consider the problem of recovering bond type information using a scoring function for the possible valences of each atom—the Bond Order Assignment problem. W...

The cycle and co-cycle matroids of a bond graph are defined using chain group matroids derived,from the cycle and co-cycle vector spaces qf a bond graph. The relationship between these structures is investigated and various results are proved. A precise equivalence is dejined for bond graphs. Duality theory is seen to be very clear in the context of bond graph matroids.