Results 191 to 200 of about 1,096,401 (237)
Some of the next articles are maybe not open access.
Bonds Intersecting Cycles In A Graph
Combinatorica, 2005A bond of a graph \(G\) is a minimum cut set of \(G\). It is proved that for a \(k\)-connected graph \(G\) with circumference \(c\geq 2k, k\geq 2\), there exists a bond which intersects every cycle of length \(c-k+2\) or greater. This result dualizes a result of the author in [Combinatorica 25, No.~4, 451--463 (2005; Zbl 1090.05039)].
openaire +2 more sources
Journal of the Chemical Society, Chemical Communications, 1981
The concept of the bond graph is introduced for the extension of ‘branching’ and ‘topological’ indices from saturated to unsaturated hydrocarbons as the key step in the construction of a general index of complexity for molecular skeletons.
openaire +1 more source
The concept of the bond graph is introduced for the extension of ‘branching’ and ‘topological’ indices from saturated to unsaturated hydrocarbons as the key step in the construction of a general index of complexity for molecular skeletons.
openaire +1 more source
ACAUSAL INFORMATION BONDS IN BOND GRAPH MODELS
IFAC Proceedings Volumes, 1989Abstract One of the roost powerful features of the bond graph method lies in the fact that the power network is described in an acausal form. This allows the creation of “true” subsystems i.e. subsystems with no causality assumption on the way they can be used.
openaire +1 more source
Journal of Dynamic Systems, Measurement, and Control, 1975
The lack of arbitrariness in the choice of bond graph sign conventions is established. It is shown that an unoriented bond graph may have no unique meaning and that with certain choices of orientation a bond graph may not correspond to any lumped parameter system constructed from the same set of elements.
openaire +2 more sources
The lack of arbitrariness in the choice of bond graph sign conventions is established. It is shown that an unoriented bond graph may have no unique meaning and that with certain choices of orientation a bond graph may not correspond to any lumped parameter system constructed from the same set of elements.
openaire +2 more sources
Morphotronics and Bond Graphs Representation
2013Bond Graphs theory can assist in tracking power movements in a system that is defined by effort and flow variables. An electronic circuit uses the network where flow (current) moves when affected by the effort (voltage). Morphotronics uses multidimensional vector space and transformations in this space to model bond graphs and the electronic circuit ...
Germano Resconi, Zenon Chaczko
openaire +1 more source
Convection bonds and bond graphs
Journal of the Franklin Institute, 1991Abstract Bonds which have two effort or potential variables and one flow variable are proposed to represent the interaction of system elements involving the flowof a pure substance, particularly when that substance is compressible. The meanings of the traditional 0 and 1 junctions, the two-port RS element and the multiport C element are ...
openaire +1 more source
On decomposing a graph into nontrivial bonds
Journal of Graph Theory, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Bond Graph Junction Structures
Journal of Dynamic Systems, Measurement, and Control, 1975The relationship between the port constitutive equations of a bond graph junction structure and the constitutive equations of its individual junctions is investigated. By combining network, bond graph, and graph theoretic techniques, the roles of bond orientation and causal assignments in determining when internal bond variables may be eliminated are ...
openaire +2 more sources
Hamiltonian and lagrangian bond graphs
Journal of the Franklin Institute, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Mathematics and Computers in Simulation, 2000
We define bond graphs in a completely new way, and thereby justify the bond graph terminology in the framework of classical network theory. We discuss some interrelations between bond graphs and Minty networks.
A Reibiger, H Loose
exaly +2 more sources
We define bond graphs in a completely new way, and thereby justify the bond graph terminology in the framework of classical network theory. We discuss some interrelations between bond graphs and Minty networks.
A Reibiger, H Loose
exaly +2 more sources

