Results 21 to 30 of about 480,859 (244)
Interval-Valued Fuzzy Soft Graphs
Topological Algebra and its Applications, 2017 In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +1 more source
Closed orders and closed graphs
Analele 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
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
EPG-representations with small grid-size [PDF]
, 2017 In an EPG-representation of a graph $G$ each vertex is represented by a path in the rectangular grid, and $(v,w)$ is an edge in $G$ if and only if the paths representing $v$ an $w$ share a grid-edge. Requiring paths representing edges to be x-monotone or,
A Asinowski +11 more
core +2 more sources
"Building" exact confidence nets [PDF]
, 2016 Confidence nets, that is, collections of confidence intervals that fill out the parameter space and whose exact parameter coverage can be computed, are familiar in nonparametric statistics.
Francis, Andrew R. +2 more
core +2 more sources
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 +3 more
doaj +1 more source
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet 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
A lower bound for nodal count on discrete and metric graphs
, 2006 According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th ...
A.M. Duval +17 more
core +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 SystemsThe 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 +4 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 +2 more
doaj +1 more source