Results 21 to 30 of about 1,096,401 (237)

Computing the largest bond of a graph

CoRR, 2019
A bond of a graph $G$ is an inclusion-wise minimal disconnecting set of $G$, i.e., bonds are cut-sets that determine cuts $[S,V\setminus S]$ of $G$ such that $G[S]$ and $G[V\setminus S]$ are both connected. Given $s,t\in V(G)$, an $st$-bond of $G$ is a bond whose removal disconnects $s$ and $t$.
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza   +4 more
openaire   +6 more sources

Storage Device Sizing for a Hybrid Railway Traction System by Means of Bicausal Bond Graphs [PDF]

, 2006
In this paper, the application of bicausal bond graphs for system design in electrical engineering is emphasized. In particular, it is shown how this approach is very useful for model inversion and parameter dimensioning.
Sareni, Bruno, Gandanegara, Grace, Roboam, Xavier   +2 more
core   +1 more source

Learning @ Bond

, 2011
Learning at Bond has been written specifically for students at Bond University. It contains practical and useful information for students across all levels and faculties. Inside the booklet you will find definitions, tips and strategies on how to enhance
Wheeler, Joanne, Kinash, Shelley, Knight, Diana, Macfarlane, Susan   +3 more
core   +4 more sources

Simulation methods of rigid holonomic multibody systems with bond graphs

Advances in Mechanical Engineering, 2019
Bond graph software can simulate bond graph models without the user needing to manually derive equations. This offers the power to model larger and more complex systems than in the past.
Benjamin Boudon, Thu Thuy Dang, Rebecca Margetts, Wolfgang Borutzky, François Malburet   +4 more
doaj   +1 more source

Graph Models of Automobile Gears - Kinematics

International Journal of Applied Mechanics and Engineering, 2014
In the present paper, kinematical analysis of an automotive gear is described. Versatile graph based methods have been utilized for this purpose. An application of mixed, contour and bond graphs gives the same results. It allows the detection of possible
J. Drewniak, J. Kopeć, S. Zawiślak
doaj   +1 more source

Bond-graph Methods for Electric Circuits Analysis [PDF]

Journal of Electrical and Electronics Engineering, 2012
The paper presents a bond-graph method for solving and analyzing an electric circuit with four or more circuit loops. Using this method, the time for circuit analysis is much shorter then using a classicalmethod.
GRAVA Adriana, GRAVA Cristian, NOVAC Mihaela, PANTEA Mircea   +3 more
doaj  

Some Bond Incident Degree Indices of Cactus Graphs

Journal of Mathematics, 2022
A connected graph in which no edge lies on more than one cycle is called a cactus graph (also known as Husimi tree). A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the ...
Akbar Ali, Akhlaq Ahmad Bhatti, Naveed Iqbal, Tariq Alraqad, Jaya Percival Mazorodze, Hicham Saber, Abdulaziz M. Alanazi   +6 more
doaj   +1 more source

A Novel Evolutionary Algorithm for Designing Robust Analog Filters

Algorithms, 2018
Designing robust circuits that withstand environmental perturbation and device degradation is critical for many applications. Traditional robust circuit design is mainly done by tuning parameters to improve system robustness.
Shaobo Li, Wang Zou, Jianjun Hu
doaj   +1 more source

On deletions of largest bonds in graphs

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei 0001, Haidong Wu   +4 more
openaire   +2 more sources

Contractible bonds in graphs

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources