Identifying disease-associated microRNAs (disease miRNAs) contributes to the understanding of disease pathogenesis. Most previous computational biology studies focused on multiple kinds of connecting edges of miRNAs and diseases, including miRNA&ndas...
The restricted edge-connectivity of a connected graph G, denoted by λ′(G), if it exists, is the minimum cardinality of a set of edges whose deletion makes G disconnected, and each component has at least two vertices. It was proved that &...
The reliability measure of networks is of significant importance to the design and maintenance of networks. Based on connectivity, many refined quantitative indicators for the reliability of network systems have been introduced. The super vertex edge...
A graph is called strongly Menger-edge connected (SME-connected) if any two vertices are connected by as many edge-disjoint paths as their smaller degree. For positive integers t and r, a graph G is called t-edge-fault-tolerant SME-connected (t-EFT-S...
A 3-restricted edge cut is an edge cut of a connected graph that separates this graph into components, each having an order of at least 3. The minimum size of all 3-restricted edge cuts of a graph is called its 3-restricted edge connectivity. This wo...
Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity λp(Γ) of a graph Γ was introduced by Fàbrega and Fiol in 1996....
Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H∈H. In this article, we characterize all connected subgraph pairs {R,S} guranteeing the edge-connectivity of a connected {R,S}-free gr...
This study presents a newly developed edge computing platform designed to enhance connectivity between edge devices and the cloud in the agricultural sector. Addressing the challenge of synchronizing a central database across 850 remote farm location...
Marine transportation is pivotal in the rapid development of global trade, significantly enhancing international economic and trade connectivity and impacting the sustainable development of the global economy. In this study, we developed a novel tech...
Graph theory plays a central role in mathematics, biology, chemistry, computer science, and related disciplines. It has many applications in everyday life, particularly in chemistry, biology, and network theory. Chemical graph theory is a subfield de...
As a sustainable construction material, timber is more promoted than steel, concrete, and aluminum nowadays. The building industry benefits from using timber based on several perspectives, including decarbonization, improved energy efficiency, and ea...
Investigating the phonatory processes in connected speech from high-speed videoendoscopy (HSV) demands the accurate detection of the vocal fold edges during vibration. The present paper proposes a new spatio-temporal technique to automatically segmen...
This paper proposes a collaborative framework to support task offloading in connected vehicular environments. The approach relies on the dynamic formation of temporary teams of connected vehicles in a mobile edge computing scenario. A novel trust mod...
This paper introduces a method to create a moment-resisting edge connection between two cross-laminated timber (CLT) panels. With this connection, two-way spanning cross-laminated timber slabs can be realised, where the span exceeds the manufacturing...
Advanced generations of mobile network technologies (XG), last-mile connectivity and edge computing solutions can offer invaluable support for farmers and agribusinesses, fostering sustainable development, though unequal access to these digital techn...
In connected cars with various electronic control unit (ECU) modules, Ethernet is used to communicate data received by the sensor in real time, but it is partially used alongside a controller area network (CAN) due to the cost. There are security thr...
The emerging technology of internet of connected vehicles (IoCV) introduced many new solutions for accident prevention and traffic safety by monitoring the behavior of drivers. In addition, monitoring drivers’ behavior to reduce accidents has attract...
Functional differences in key brain networks, including the dorsal attention network (DAN), control network (CN), and default mode network (DMN), have been identified in individuals with obsessive–compulsive disorder (OCD). However, the precise...
“Linearly many faults” is a phenomenon observed by Cheng and Lipták in which a specific structure emerges when a graph is disconnected and often occurs in various interconnection networks. This phenomenon means that if a certain nu...
A Pogorelov polytope is a combinatorial simple 3-polytope realizable in the Lobachevsky (hyperbolic) space as a bounded right-angled polytope. These polytopes are exactly simple 3-polytopes with cyclically 5-edge connected graphs. A Pogorelov polytop...
Extra edge connectivity is an important parameter for measuring the reliability of interconnection networks. Given a graph G and a non-negative integer h, the h-extra edge connectivity of G, denoted by λhG, is the minimum cardinality of a set...
The topology structure of multi-layer networks is highly correlated with the robustness of consensus. This paper investigates the influence of different interlayer edge connection patterns on the consensus of the two-layer ring networks. Two types of...
In this research study, we introduce the notion of single-valued neutrosophic incidence graphs. We describe certain concepts, including bridges, cut vertex and blocks in single-valued neutrosophic incidence graphs. We present some properties of singl...
An edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color. A rainbow coloring refers to an edge coloring that g...
In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs. If a nontrivial path contains only internal vertices of degree two and end vertices...
Depth-first search (DFS) is a well-known graph traversal algorithm and can be performed in O ( n + m ) time for a graph with n vertices and m edges. We consider the dynamic DFS problem, that is, to maintain a DFS tree of an undirected graph G...
Optical sensing that integrates communication and sensing functions is playing a more and more important role in both military and civil applications. Incorporating optical sensing and optical communication, optical sensor networks (OSNs) that undert...
A (2,6)-fullerene F is a 2-connected cubic planar graph whose faces are only 2-length and 6-length. Furthermore, it consists of exactly three 2-length faces by Euler’s formula. The (2,6)-fullerene comes from Došlić’s (k,6)-ful...
6G will connect heterogeneous intelligent agents to make them natively operate complex cooperative tasks. When connecting intelligence, two main research questions arise to identify how artificial intelligence and machine learning models behave depen...
An edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices. Some graphs can admit a...
Habitat fragmentation threatens terrestrial arthropod biodiversity, and thereby also leads to alterations of ecosystem functioning and stability. Predation on insects and seeds by arthropods are two very important ecological functions because of thei...
Cooperative environmental perception is an effective way to provide connected and autonomous vehicles (CAVs) with the necessary environmental information. The research goal of this paper is to achieve efficient sharing of cooperative environmental pe...
Nowadays, transport is the basis for the functioning of national, continental, and global economies. Thus, many governments recognize it as a critical element in ensuring the daily existence of societies in their countries. Those responsible for the...
In this paper, some collision avoidance systems based on MEC in a VANET environment are proposed and investigated. Micro services at edge are considered to support service continuity in vehicle communication and advertising. This considered system ma...
In the context of Western China’s unique geography, recurrent landslide disasters pose substantial threats to both resident safety and economic stability. The escalating frequency of these incidents emphasizes the critical need for innovative d...
The Cloud-Based Secured Connection Management Model (CS-CMM) for high-density fog networks is a novel approach that leverages cloud resources and the proliferation of computing power at the edge of networks. The model seeks to address the challenges...
In the era of ubiquitous computing, the challenges imposed by the increasing demand for real-time data processing, security, and energy efficiency call for innovative solutions. The emergence of fog computing has provided a promising paradigm to addr...
With the improvements in the intelligent level of connected vehicles (CVs), travelers can enjoy services such as self-driving, self-parking and audiovisual entertainment inside the vehicle, which place extremely high demands on the computing power of...
Within the research project ITSAFE, two full-scale structures were built, one consisting of a single-storey, two-span, 7.00 × 14.00 m2 RC frame with a solid slab and another consisting of a two-storey, 7.00 × 7.00 m2 RC frame with solid s...
Improving the accuracy of edge pixel classification is crucial for extracting the winter wheat spatial distribution from remote sensing imagery using convolutional neural networks (CNNs). In this study, we proposed an approach using a partly connecte...
With the rapid evolution in wireless communications and autonomous vehicles, intelligent and autonomous vehicles will be launched soon. Vehicle to Everything (V2X) communications provides driving safety, traffic efficiency, and road information in re...
A fundamental aspect of network analysis involves pinpointing nodes that hold significant positions within the network. Graph theory has emerged as a powerful mathematical tool for this purpose, and there exist numerous graph-theoretic parameters for...
With increasing numbers of computer vision and object detection application scenarios, those requiring ultra-low service latency times have become increasingly prominent; e.g., those for autonomous and connected vehicles or smart city applications. T...
Cognitive network science has increased our understanding of how the mental lexicon is structured and how that structure at the micro-, meso-, and macro-levels influences language and cognitive processes. Most of the research using this approach has...
The proliferation of edge intelligence systems necessitates efficient and reliable connectivity for sensor networks deployed at the edge. This paper proposes a novel energy-efficient connectivity algorithm called Constrained Angle-aware Connectivity...
The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by dim(G) (respectively edim(G)). The upper bounds dim(G)&l...
This paper presents an analytical evaluation of three strategies designed to minimize service disruption during handovers in Software-Defined Networking (SDN)-based connected car networks: SDN Mobility with a Caching Policy, cache-miss Content Delive...
The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry. This pa...
Edge computing represents the future of computing paradigms that perform tasks near the user plane. The integration of blockchain with edge computing provides the added advantage of secured and trusted communication. In this paper, we propose a block...
This paper concerns the formation problem in multi-USV cluster formation containment tracking tasks with a special topology. A topology reconstruction method was proposed that enables the followers’ formation to be dispersed while achieving the...
of 43