Affiliation:
1. College of Information Engineering, Henan University of Science and Technology, Luoyang, China
2. College of Agricultural Equipment Engineering, Henan University of Science and Technology, Luoyang, China
Abstract
In this paper, the problem of formulating and finding externally independent sets of graphs is considered by using a newly developed STP method, called semitensor product of matrices. By introducing a characteristic value of a vertex subset of a graph and using the algebraic representation of pseudological functions, several necessary and sufficient conditions of matrix form are proposed to express the externally independent sets (EISs), minimum externally independent sets (MEISs), and kernels of graphs. Based on this, the concepts of EIS matrix, MEIS matrix, and kernel matrix are introduced. By these matrices’ complete characterization of these three structures of graphs, three algorithms are further designed which can find all these kinds of subsets of graphs mathematically. The results are finally applied to a WSN covering problem to demonstrate the correctness and effectiveness of the proposed results.
Funder
National Natural Science Foundation of China
Reference33 articles.
1. Properly colored connectivity of graphs introduction;X. L. Li,2018
2. Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method
3. A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity
4. Matrix method to search k-maximum internally stable sets of graphs;J. M. Yue;Proceedings of the 34th Chinese Control Conference,2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献