648 research outputs found
Forbidden subgraphs that imply Hamiltonian-connectedness
It is proven that if is a -connected claw-free graph which is also -free (where is a triangle with a path of length attached), -free (where is a path with vertices) or -free (where consists of two disjoint triangles connected by an edge), then is Hamiltonian-connected. Also, examples will be described that determine a finite family of graphs such that if a 3-connected graph being claw-free and -free implies is Hamiltonian-connected, then . \u
A network dynamics approach to chemical reaction networks
A crisp survey is given of chemical reaction networks from the perspective of
general nonlinear network dynamics, in particular of consensus dynamics. It is
shown how by starting from the complex-balanced assumption the reaction
dynamics governed by mass action kinetics can be rewritten into a form which
allows for a very simple derivation of a number of key results in chemical
reaction network theory, and which directly relates to the thermodynamics of
the system. Central in this formulation is the definition of a balanced
Laplacian matrix on the graph of chemical complexes together with a resulting
fundamental inequality. This directly leads to the characterization of the set
of equilibria and their stability. Both the form of the dynamics and the
deduced dynamical behavior are very similar to consensus dynamics. The
assumption of complex-balancedness is revisited from the point of view of
Kirchhoff's Matrix Tree theorem, providing a new perspective. Finally, using
the classical idea of extending the graph of chemical complexes by an extra
'zero' complex, a complete steady-state stability analysis of mass action
kinetics reaction networks with constant inflows and mass action outflows is
given.Comment: 18 page
On some intriguing problems in Hamiltonian graph theory -- A survey
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular graphs, -tough graphs, and claw-free graphs
- …