Results 11 to 20 of about 479,648 (240)
Combination of interval-valued neutrosophic soft sets and graph theory
In this paper, we combine the concepts of interval-valued neutrosophic soft set and graph theory. We introduce notations of interval-valued neutrosophic soft graph and complete interval-valued neutrosophic soft graph. We also present several different types operations including cartesian product, union and intersection on interval-valued neutrosophic ...
Yildiray Celik, Guven Kara
openaire +1 more source
The average geodesic distance L Newman (2003) and the compactness CB Botafogo (1992) are important graph indices in applications of complex network theory to real-world problems.
Tatiana Lokot +2 more
doaj +2 more sources
Interval Valued Intuitionistic Fuzzy Line Graphs
Objectives In the field of graph theory, an intuitionistic fuzzy set becomes a useful tool to handle problems related to uncertainty and impreciseness. We introduced the interval-valued intuitionistic fuzzy line graphs (IVIFLG) and explored the results ...
V. N. Srinivasa Rao Repalle +2 more
doaj +1 more source
Consensus of Second-Order Heterogeneous Hybrid Multiagent Systems via Event-Triggered Protocols
This paper investigates the event-based consensus problem for the heterogeneous hybrid multiagent system (MAS). First, the heterogeneous hybrid MAS is proposed which contains continuous and discrete-time subsystems with second-order and first-order ...
Hong Zhang, Yanhan Li, Ying Zheng
doaj +1 more source
Fault detection in the landing gear retraction/extension hydraulic system is difficult due to uncertainties in component parameters and sensor measurement values.
Yuyuan Cao +5 more
doaj +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
A graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]
Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graph G has pathwidth at most k admits no polynomial kernelization with respect to k.
B. Monien +14 more
core +1 more source
This paper investigates a distributed coordination control for a class of high-order uncertain multiagent systems. Under the framework of iterative learning control, a novel fully distributed learning protocol is devised for the coordination problem of ...
Nana Yang, Suoping Li
doaj +1 more source
Optimal Control Synthesis of Timed Event Graphs With Interval Model Specifications [PDF]
The purpose of this technical note is the optimal control synthesis of a timed event graph when the state and control trajectories should follow the specifications defined by an interval model.
M.K.Didi Alaoui, P. Declerck
core +2 more sources
Interval-Valued Fuzzy Soft Graphs
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

