Results 21 to 30 of about 176 (155)

Closed orders and closed graphs

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Crupi Marilena
doaj   +1 more source

On Strong Intervals in Fuzzy Graphs

open access: yesFuzzy Information and Engineering, 2017
Intervals and convexity play crucial roles in the applications of graph theory such as town planning and design of graphics. In this article, the concept of geodetic interval in graphs is extended to fuzzy graphs.
M.V. Dhanyamol, Sunil Mathew
doaj   +1 more source

Robust Consensus in a Class of Fractional-Order Multi-Agent Systems with Interval Uncertainties Using the Existence Condition of Hermitian Matrices

open access: yesAxioms, 2023
This study outlines the necessary and sufficient criteria for swarm stability asymptotically, meaning consensus in a class of fractional-order multi-agent systems (FOMAS) with interval uncertainties for both fractional orders 0 < α < 1 and 1 < α < 2. The
Mohammadreza Riazat   +3 more
doaj   +1 more source

High-speed train cooperative control based on fractional-order sliding mode adaptive algorithm [PDF]

open access: yesRailway Sciences, 2023
Purpose – This study aims to propose an adaptive fractional-order sliding mode controller to solve the problem of train speed tracking control and position interval control under disturbance environment in moving block system, so as to improve the ...
Junting Lin, Mingjun Ni, Huadian Liang
doaj   +1 more source

Leanness Computation: Small Values and Special Graph Classes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert   +2 more
doaj   +1 more source

Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj   +1 more source

Modeling of Transport and Logistics Systems and the Study of the Structural Stability

open access: yesУправленческие науки, 2020
The structural stability of the system to external influences is an important parameter of the transport and logistics task. In modern literature, the concept of structural stability is defined as applied to each individual problem, as a result of which ...
D. V. Yatskin   +2 more
doaj   +1 more source

Anticipation of ventricular tachyarrhythmias by a novel mathematical method: Further insights towards an early warning system in implantable cardioverter defibrillators

open access: yesPLoS ONE, 2020
Implantable cardioverter defibrillators (ICD) are the most effective therapy to terminate malignant ventricular arrhythmias (VA) and therefore to prevent sudden cardiac death. Until today, there is no way to predict the onset of such VA.
Gabriel S. Zamudio   +3 more
doaj   +2 more sources

Quantifying Uncertainty in Brain Network Measures using Bayesian Connectomics

open access: yesFrontiers in Computational Neuroscience, 2014
The wiring diagram of the human brain can be described in terms of graph measures that characterize structural regularities. These measures require an estimate of whole-brain structural connectivity for which one may resort to deterministic or ...
Ronald Johannes Janssen   +4 more
doaj   +1 more source

Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
Interval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy