Computing Connected Resolvability of Graphs Using Binary Enhanced Harris Hawks Optimization

In this paper,we consider the NP-hard problem offinding the minimum connected resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the ver-tices in B.A resolving set B of G is connected if the subgraph B induced by B is a nontrivial connected subgraph of G.The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G.The problem is solved heuristically by a binary version of an enhanced Harris Hawk Optimization(BEHHO)algorithm.This is thefirst attempt to determine the connected resolving set heuristically.BEHHO combines classical HHO with opposition-based learning,chaotic local search and is equipped with an S-shaped transfer function to convert the contin-uous variable into a binary one.The hawks of BEHHO are binary encoded and are used to represent which one of the vertices of a graph belongs to the connected resolving set.The feasibility is enforced by repairing hawks such that an addi-tional node selected from V\B is added to B up to obtain the connected resolving set.The proposed BEHHO algorithm is compared to binary Harris Hawk Optimi-zation(BHHO),binary opposition-based learning Harris Hawk Optimization(BOHHO),binary chaotic local search Harris Hawk Optimization(BCHHO)algorithms.Computational results confirm the superiority of the BEHHO for determining connected metric dimension.

L(h, k)-Labeling of Circulant Graphs

An L(h,k)-labeling of a graph G is an assignment of non-negative integers to the vertices such that if two vertices u and v are adjacent then they receive labels that differ by at least h, and when u and v are not adjacent but there is a two-hop path between them, then they receive labels that differ by at least k. The span λ of such a labeling is the difference between the largest and the smallest vertex labels assigned. Let λhk ( G )denote the least λ such that G admits an L(h,k) -labeling using labels from {0,1,...λ}. A Cayley graph of group is called circulant graph of order n, if the group is isomorphic to Zn. In this paper, initially we investigate the L(h,k) -labeling for circulant graphs with “large” connection sets, and then we extend our observation and find the span of L(h,k) -labeling for any circulants of order n. .

Backbone formulation algorithm in wireless sensor network based on cross-entropy method

In wireless sensor network,virtual backbone is a cost effective broadcasting method.Connected dominating set formation is proposed to construct a virtual backbone.However,it is NP-Hard to find a minimum connected dominating set in an arbitrary graph.In this paper,based on cross-entropy method,we present a novel backbone formulation algorithm(BFA-CE)in wireless sensor network.In BFA-CE,a maximal independent set is got at first and nodes in the independent set are required to get their action sets.Based on those action sets,a backbone is generated with the cross-entropy method.Simulation results show that our algorithm can effectively reduce the size of backbone network within a reasonable message overhead,and it has lower average node degree.This approach can be potentially used in designing efficient broadcasting strategy or working as a backup routing of wireless sensor network.

A Research for Regional Contribution Rate of Internal Source and External Source of PM_(2.5) Based on Set Pair Analysis Method

A problem of the air pollution control in China is getting to know a regional contribution rate of internal and external source of PM2.5. In this paper,Set Pair Analysis（ SPA） method is proposed to calculate the contribution rate of PM2.5in Dongguan City. Due to geographic,meteorological factors and the low concentration of air pollutants in Qingxi area,the PM2.5in this place is mainly contributed by the regional transport of air pollutants from other inside areas of Dongguan,and less affected by the outside of Dongguan. So the concentration of PM2.5in Qingxi area can reflect the Dongguan＇s basic background concentration of PM2.5. On the basis of the basic background concentration,firstly the concentration of each pollutant components is divided into the internal part and the mixed part. Secondly using the source apportionment samples of five monitoring sites in Dongguan we can respectively construct a sample set A and an evaluation set B. Thirdly the SPA is operated onto the mixed part in terms of set B.At last the connection degree between the concentration of each pollutant components and external source and internal source will be calculated,that is the contribution rate. The research reveals that the contribution rate of internal source and external source of PM2.5in Dongguan City is 83%and 17% respectively,which roughly met expectations. This method is simple and effective and it can provide a reference for the government taking reduction measures to control PM2.5pollutants emission.

SOME MULTIPLICITY RESULTS FOR AN ELASTIC BEAM EQUATION AT RESONANCE

This paper deals with multiplicity results for nonlinear elastic equations of the typewheregi[0,1] X R R satisfies Caratheodory condition L2[0,1]. The solvability of this problem has been studied by several authors, but there isn't any multiplicity result until now to the author's knowledge. By combining the Lyapunov-Schmidt procedure with the technique of connected set, we establish several multiplicity results under suitable condition.

Topologically Finite Intersection Property and Minimax Theorems

A more general lopologically finite intersection property is obtained. As anapplication,we utilize this result to obtain some more general minimax theorems. Theresults presented in this paper unify and extend the main results of [5, 6, 9].

Paired, Total, and Connected Domination on the Queen’s Graph Revisited

The question associated with total domination on the queen’s graph has a long and rich history, first having been posed by Ahrens in 1910 [1]. The question is this: What is the minimum number of queens needed so that every square of an n × n board is attacked? Beginning in 2005 with Amirabadi, Burchett, and Hedetniemi [2] [3], work on this problem, and two other related problems, has seen progress. Bounds have been given for the values of all three domination parameters on the queen’s graph. In this paper, formations of queens are given that provide new bounds for the values of total, paired, and connected domination on the queen’s graph, denoted , , and respectively. For any n × n board size, the new bound of is arrived at, along with the separate bounds of , for with , and , for with .

Upper Bound Involving Parameter σ_2 for the Rainbow Connection Number

Let G be a connected graph of order n. The rainbow connection number rc（G） of G was introduced by Chartrand et al. Chandran et al. used the minimum degree of G and obtained an upper bound that rc（G） 〈_ 3n/（ δ＋ 1） - 3, which is tight up to additive factors. In this paper, we use the minimum degree-sum a2 6n of G to obtain a better bound rc（G） _〈 - 8, especially when is small （constant） but a2 is large （linear in n）.

AHBP: An Efficient Broadcast Protocol forMobile Ad Hoc Networks

Broadcast is an important operation in many network protocols. It is utilized to discover routes to unknown nodes in mobile ad hoc networks (MANETs) and is the key factor in scaling on-demand routing protocols to large networks. This paper presents the Ad Hoc Broadcast Protocol (AHBP) and its performance is discussed. In the protocol, messages are only rebroadcast by broadcast relay gateways that constitute a connected dominating set of the network. AHBP can efficiently reduce the redundant messages which make flooding-like protocols perform badly in large dense networks. Simulations are conducted to determine the performance characteristics of the protocol. The simulation results have shown excellent reduction of broadcast redundancy with AHBP. It also contributes to a reduced level of broadcast collision and congestion.

A Distributed Design for Minimum 2-Connected m-Dominating Set in Bidirectional Wireless Ad-Hoc Networks

Wireless ad-hoc network is widely used in many fields for its convenience and outstanding suitability. Because of the inherent lack of infrastructure and the nature of wireless channels, people select the k-Connected m-Dominating Set （（k,m）-CDS） in a network as a fault-tolerant virtual backbone to help the routing process, which will save the energy of non-dominators and improve the network performance significantly. Considering the economic cost and efficiency, we choose （2,m）-CDS as the object of this paper, which is helpful enough in practical applications and has a smaller size. We firstly study the existing algorithms for （k,m）- CDS and figure out the problems of these designs. Then we propose a new distributed algorithm named Dominating Set Based AIgorithm （DSBA） with three sub-routines： Dominating Set AIgorithm （DSA）, Connection Algorithm （CA）, and Connectivity Expansion Algorithm （CEA）. Instead of commonly used Maximal Independent Set （MIS）, we pick dominating set directly from the given graph, and then connect them by a two-step ring based connecting strategy to satisfy the 2-connectivity. We also provide the correctness and complexity analysis of DSBA. At last, we compare DSBA with the last construction Distributed Deterministic Algorithm （DDA） by several numerical experiments. The simulation results show that DSBA improves over 30 percent of the performance of DDA, proving that DSBA is more practical for real-world applications.

Approximation Algorithms for Steiner Connected Dominating Set

Steiner connected dominating set （SCDS） is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and known to be NP- hard. This paper firstly modifies the SCDS algorithm of Guha and Khuller and achieves a worst case approximation ratio of （2 ＋ 1/（m - 1））H（min（△, k）） ＋O（1）, which outperforms the previous best result （c ＋ 1）H（min（△, k）） ＋ O（1） in the case of m ≥ 1 ＋1/（c - 1）, where c is the best approximation ratio for Steiner tree, A is the maximum degree of the graph, k is the cardinality of the set of required vertices, m is an optional integer satisfying 0 ≤ m ≤ min（△, k） and H is the harmonic function. This paper also proposes another approximation algorithm which is based on a greedy approach. The second algorithm can establish a worst case approximation ratio of 2 ln（min（△, k）） ＋ O（1）, which can also be improved to 2 lnk if the optimal solution is greater than c·e^2c＋1/2（c＋1）.