Results 21 to 30 of about 40,841 (125)

On Strong Intervals in Fuzzy Graphs

Fuzzy 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

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

Discrete 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, Samuel Coulomb, Guillaume Ducoffe   +2 more
doaj   +1 more source

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

AKCE 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, Manoj Changat, Lekshmi Kamal K. Sheela, Abhirami R. S, Amrutha U.A.   +4 more
doaj   +1 more source

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

Journal of Graph Algorithms and Applications, 2017
This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model ${\mathcal{M}}$ is given and the goal is to obtain an equivalent UCA model ${\mathcal{U}}$. In
openaire   +3 more sources

Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm [PDF]

Neutrosophic Sets and Systems
The A* search algorithm is widely utilized to evaluate the shortest path in a given network. However, in a traditional A* search algorithm, the nodes are assumed to have crisp values, i.e., a single value.
Prasanta Kumar Raut, Sakya Singh Satapathy, Siva Prasad Behera, Said Broumi, Ajay Kumar Sahoo   +4 more
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

Axioms, 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, Aydin Azizi, Mojtaba Naderi Soorki, Abbasali Koochakzadeh   +3 more
doaj   +1 more source

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

Управленческие науки, 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, A. A. Kochkarov, R. A. Kochkarov   +2 more
doaj   +1 more source

Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem

Mathematics, 2016
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj   +1 more source

Quantifying Uncertainty in Brain Network Measures using Bayesian Connectomics

Frontiers 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, Max eHinne, Max eHinne, Tom eHeskes, Marcel A.J. Van Gerven   +4 more
doaj   +1 more source

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

Discrete 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