Matrix Formulation of EISs of Graphs and Its Application to WSN Covering Problems
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 pseudo...
Saved in:
Main Authors: | Yongyi Yan, Jumei Yue, He Deng |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/5526532 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs
by: E. J. Farrell
Published: (1983-01-01) -
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
by: Shiping Wang, et al.
Published: (2013-01-01) -
Wasserstein Non-Negative Matrix Factorization for Multi-Layered Graphs and its Application to Mobility Data
by: Hirotaka Kaji, et al.
Published: (2025-01-01) -
Secured Routing Protocol for Improving the Energy Efficiency in WSN Applications
by: Y. P. Makimaa, et al.
Published: (2024-01-01) -
Verification and Validation of the Performance of WSN
by: Seong-eun Yoo, et al.
Published: (2015-03-01)