216 Results Found

In this paper we focus on the issue related to finding the resolving connected dominating sets (RCDSs) of a graph, denoted by G. The connected dominating set (CDS) is a connected subset of vertices of G selected to guarantee that all vertices in the...

In this paper, the concept of a strong $n$-Connected Total Perfect $k$-connected total perfect $k$-dominating set and a weak $n$-connected total perfect $k$-dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect d...

In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs. For the...

To achieve effective communication in ad hoc sensor networks, researchers have been working on finding a minimum connected dominating set (MCDS) as a virtual backbone network in practice. Presently, many approximate algorithms have been proposed to c...

Existing node deployment algorithms for underwater sensor networks are nearly unable to improve the network coverage rate under the premise of ensuring the full network connectivity and do not optimize the communication and move energy consumption du...

The computation of a set constituted by few vertices to define a virtual backbone supporting information interchange is a problem that arises in many areas when analysing networks of different natures, like wireless, brain, or social networks. Recent...

The minimum connected dominating set (MCDS) problem is a very significant NP-hard combinatorial optimization problem, and it has been used in many fields such as wireless sensor networks and ad hoc networks. In this paper, we propose a novel multi-st...

An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominatin...

Wireless sensor networks (WSNs) play a significant role in a large number of applications, e.g., healthcare and industry. A WSN typically consists of a large number of sensor nodes which rely on limited power sources in many applications. Therefore,...

In mobile ad-hoc networks (MANETs), nodes are mobility naturally which renders a great challenge in topology controls. Connected dominating set (CDS) has been considered as an efficient solution to solve such a problem by constructing a virtual backb...

The minimum connected dominating set problem is a combinatorial optimization problem with a wide range of applications in many fields. We propose an efficient local search algorithm to solve this problem. In this work, first, we adopt a new initial s...

Smart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communicati...

Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem. Another variant is the zero forcing problem. De...

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity alg...

“Vehicular Ad-hoc Networks” (VANETs): As an active research area in the field of wireless sensor networks, they ensure road safety by exchanging alert messages about unexpected events in a decentralized manner. One of the significant chal...

In wireless sensor/ad hoc networks, all wireless nodes frequently flood the network channel by transmitting control messages causing “broadcast storm problem”. Thus, inspired by the physical backbone in wired networks, a Virtual Backbone...

With the growing deployment of Flying Ad hoc Networks (FANETs) in military and civilian applications, constructing a stable and efficient communication backbone has become a critical challenge. This paper tackles the Cluster Head (CH) optimization pr...

To address the issues of low survivability and communication efficiency in wireless sensor networks caused by frequent node movement or damage in highly dynamic and high-mobility battlefield environments, we propose a dynamic topology optimization me...

Broadcasting is a common and basic operation used to support various network protocols in wireless networks. To achieve energy-efficient broadcasting is especially important for ad hoc wireless sensor networks because sensors are generally powered by...

Wireless sensor networks (WSNs) are key enablers of efficient communication in the Internet of Things (IoT) ecosystem. These networks comprise numerous sensor nodes that collaboratively collect and transmit data, requiring adaptive and energy-efficie...

A mobile ad-hoc network (MANET) is a temporary network of wireless mobile nodes. In a MANET, it is assumed that all of the nodes cooperate with each other to transfer data packets in a multi-hop fashion. However, some malicious nodes don’t coop...

Time series data of multiple water quality parameters are obtained from the water sensor networks deployed in the agricultural water supply network. The accurate and efficient detection and warning of contamination events to prevent pollution from sp...

Location estimation in wireless sensor networks (WSNs) has received tremendous attention in recent times. Improved technology and efficient algorithms systematically empower WSNs with precise location identification. However, while algorithms are eff...

For a connected graph $G=(V,E)$, the dominating set in graph G is a subset of vertices $F\subset V$ such that every vertex of $V-F$ is adjacent to at least one vertex of F. The minimum cardinality of a dominating set of G, denoted by $\gamma \left(G\right)$, is the...

Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u₁, σ(u₁)), (u₂, σ(u₂)), …(u_k, σ(u_k))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tupl...

Graph connectivity theory is important in network implementations, transportation, network routing and network tolerance, among other things. Separation edges and vertices refer to single points of failure in a network, and so they are often sought-a...

A set $D\subseteq V\left(G\right)$ is called a dominating set if $N\left[v\right]\cap D\ne \varnothing$ for every vertex v in graph G. The domination number $\gamma \left(G\right)$ is the minimum cardinality of a dominating set of G. The proximity $\pi \left(v\right)$ of a vertex v is the average distance fro...

Let G = (V, E) be a simple, finite, and connected graph. A subset S = {u₁, u₂, _…, u_k} of V(G) is called a resolving set (locating set) if for any x ∈ V(G), the code of x with respect to S that is denoted by C_S (x), which is defined as C_S ...

In graph theory, the study of domination sets has garnered significant interest due to its applications in network design and analysis. Consider a graph $G(V,E)$; a subset of its vertices is a total dominating set (TDS) if, for each $x\in V\left(G\right)$, there...

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...

Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Desp...

This study proposes a general approach to protect graphs using co-secure domination within jump graphs. In the context of graphs, a dominating set is a group of vertices that are either directly linked or connected to all other vertices within the gr...

Let H_eff (V_eff, E_eff) be a finite simple connected graph of order m with vertex set V_eff and edge set E_eff. A dominating set $S_{ds}\subseteq V_{eff}$ is called an efficiently dominating set if, for every vertex $u_a\in V_G,\hspace{0.33em}\left|N_G\left[u_a\right]\cap S_{ds}\right|=1$—where NG [u...

A vertex subset D of G is a dominating set if every vertex in $V\left(G\right)\backslash D$ is adjacent to a vertex in D. A dominating set D is independent if $G\left[D\right]$, the subgraph of G induced by D, contains no edge. The domination number $\gamma \left(G\right)$ of a graph G is the minim...

If $G=(V_G,E_G)$ is a graph of order n, we call $S\subseteq V_G$ an isolating set if the graph induced by $V_G-N_G\left[S\right]$ contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by $\iota \left(G\right).$ It is known that $\iota ($...

The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that...

In recent years, the concept of domination has been the backbone of research activities in graph theory. The application of graphic domination has become widespread in different areas to solve human-life issues, including social media theories, radio...

This study focused on the connection between organisational school culture and the success of curriculum reform. Utilizing a sample of 348 teachers in 25 Swiss schools, we investigated how different school culture types correlate with teachers’...

The concept of domination is introduced within the context of signed fuzzy graphs (signed-FGs), along with examples, as a novel metric to evaluate graph stability under varying conditions. This metric particularly focuses on dominant sets and integri...

Preserving functional connectivity is a key goal of conservation management. However, the spatially confined conservation areas may not allow for dispersal and gene flow for the intended long-term persistence of populations in fragmented landscapes....

The graph theory is one of the fundamental structures in computer science used to model various scientific and engineering problems. Many problems within the graph theory are categorized as NP-hard and NP-complete. One such problem is the minimum dom...

For a graph $G=(V,E)$ with vertex set $V=V\left(G\right)$ and edge set $E=E\left(G\right)$ , a Roman $\left\{3\right\}$ -dominating function (R $\left\{3\right\}$ -DF) is a function $f:V\left(G\right)\to \{0,1,2,3\}$ having the property that...

For a graph $G=(V,E)$ , the ...

Let G be a nontrivial connected graph. For a set $D\subseteq V\left(G\right)$, we define $\overline{D}=V\left(G\right)\setminus D$. The set D is a total outer-independent dominating set of G if $\left|N\right(v)\cap D|\ge 1$ for every vertex $v\in V\left(G\right)$ and $\overline{D}$ is an independent set of G. Moreove...

Considering a fuzzy graph G is simple and can be connected and considered as a subset $H=\left\{\left(u_1,\sigma \left(u_1\right)\right),\left(u_2,\sigma \left(u_2\right)\right),\dots \left(u_k,\sigma \left(u_k\right)\right)\right\}, \left|H\right|\ge 2$; then, every two pairs of elements of $\sigma -H$ have a unique depiction with the relation of $H$...

We investigate a variation of the classical voter model where the set of influencing agents depends on an individual’s current opinion. The initial population is made up of a random sample of equally sized sub-populations for each state, and tw...

The Internet of Battlefield Things is a newly born cyberphysical system and, even though it shares a lot with the Internet of Things and with ad hoc networking, substantial research is required to cope with its scale and peculiarities. This article e...

Utilization of digital connectivity tools is the driving force behind the transformation of the power distribution system into a smart grid. This paper places itself in the smart grid domain where consumers exploit digital connectivity to form partit...

Stylolites are ubiquitous structures in carbonates that present a variety of morphologies. Besides being important structures in terms of rock compaction and deformation, stylolites control limestone permeability, which is influenced by their morphol...

This paper develops a new type of shear connection for steel-concrete composite bridges using Ultra-High Performance Concrete (UHPC) as the connection grout. The UHPC-grout strip shear connection is fabricated by preforming a roughened slot in the co...