Results 11 to 20 of about 469,093 (241)

Graphical Structures of Cubic Intuitionistic Fuzzy Information

Journal of Mathematics, 2021
The theory developed in this article is based on graphs of cubic intuitionistic fuzzy sets (CIFS) called cubic intuitionistic fuzzy graphs (CIFGs). This graph generalizes the structures of fuzzy graph (FG), intuitionistic fuzzy graph (IFG), and interval ...
Sami Ullah Khan, Naeem Jan, Kifayat Ullah, Lazim Abdullah   +3 more
doaj   +1 more source

Connectivity Index in Vague Graphs with Application in Construction

Discrete Dynamics in Nature and Society, 2022
The vague graph (VG), which has recently gained a place in the family of fuzzy graph (FG), has shown good capabilities in the face of problems that cannot be expressed by fuzzy graphs and interval-valued fuzzy graphs. Connectivity index (CI) in graphs is
Huiqin Jiang, Yongsheng Rao
doaj   +1 more source

On interval number in cycle convexity [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo, Guillaume Ducoffe, Nicolas Nisse, Karol Suchan   +3 more
doaj   +1 more source

Interval Valued Intuitionistic Fuzzy Line Graphs

BMC Research Notes, 2022
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, Keneni Abera Tola, Mamo Abebe Ashebo   +2 more
doaj   +1 more source

On the asymptotic behavior of the average geodesic distance L and the compactness CB of simple connected undirected graphs whose order approaches infinity

PLoS ONE, 2021
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, Olga Abramov, Alexander Mehler   +2 more
doaj   +2 more sources

Consensus of Second-Order Heterogeneous Hybrid Multiagent Systems via Event-Triggered Protocols

Complexity, 2022
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 of Landing Gear Retraction/Extension Hydraulic System Based on Bond Graph-Linear Fractional Transformation Technique and Interval Analytic Redundancy Relations

Applied Sciences, 2022
Fault detection in the landing gear retraction/extension hydraulic system is difficult due to uncertainties in component parameters and sensor measurement values.
Yuyuan Cao, Shixuan Duan, Yanjun Li, Xudong Li, Zejian Zhao, Xingye Wang   +5 more
doaj   +1 more source

On Generalizations of Pairwise Compatibility Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
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, Manuel Lafond, Angelo Monti, Blerina Sinaimeri   +3 more
doaj   +1 more source

Kernel Bounds for Structural Parameterizations of Pathwidth [PDF]

, 2012
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, F. Clautiaux, F. Eijkhof van den, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, J. Guo, J. Gustedt, J.A. Ellis, N. Robertson, R.H. Möhring, S. Arnborg   +14 more
core   +1 more source

Distributed Coordination for a Class of High-Order Multiagent Systems Subject to Actuator Saturations by Iterative Learning Control

Complexity, 2022
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