Results 1 to 10 of about 126,892 (230)
Saturation problems in the Ramsey theory of graphs, posets and point sets [PDF]
In 1964, Erd s, Hajnal and Moon introduced a saturation version of Tur n's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, $n$-vertex graph with the property that the addition of any further edge yields a copy of $K_r$. We consider analogues of this problem in other settings.
Damásdi, Gábor +5 more
+7 more sources
Social Network Analysis and Churn Prediction in Telecommunications Using Graph Theory
Due to telecommunications market saturation, it is very important for telco operators to always have fresh insights into their customer’s dynamics. In that regard, social network analytics and its application with graph theory can be very useful. In this
Stefan M. Kostić +2 more
doaj +2 more sources
Utilizing m-Polar Fuzzy Saturation Graphs for Optimized Allocation Problem Solutions
It is well known that crisp graph theory is saturated. However, saturation in a fuzzy environment has only lately been created and extensively researched. It is necessary to consider m components for each node and edge in an m-polar fuzzy graph.
Abdulaziz M. Alanazi +4 more
doaj +2 more sources
This paper investigates the application of graph theory and variants of greedy graph coloring algorithms for the optimization of distributed peer-to-peer networks, with a special focus on private blockchain networks.
Miljenko Švarcmajer +3 more
doaj +2 more sources
We focus on fault-tolerant consensus for heterogeneous dynamics systems with static and dynamic leaders under input saturation in this article. We apply theory of finite-time stability to multiagent system cooperative control.
Jie Wu, Zijing Li, Xisheng Zhan
doaj +2 more sources
Aiming at maneuvering, input saturation, and communication interference in the controller design for formation control multi-agent systems, a novel nonlinear bounded controller is proposed.
Zhigang Xiong +3 more
doaj +1 more source
Guessing Numbers and Extremal Graph Theory [PDF]
For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the colors of the
J. Martin, Puck Rombach
semanticscholar +1 more source
Collaborative consensus control of multiagent systems has become an important research topic in the field of artificial intelligence in recent years. This paper deals with the couple-group consensus for the first order discrete-time systems with input ...
Qi Han +6 more
doaj +1 more source
Triangles in Ks-saturated graphs with minimum degree t
For $n \geq 15$, we prove that the minimum number of triangles in an $n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, and that there is a unique extremal graph.
Craig Timmons +3 more
doaj +1 more source
Underwater Image Enhancement Based on the Improved Algorithm of Dark Channel
Enhancing underwater images presents a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity.
Dachang Zhu
doaj +1 more source

