Matrix formulation of EISs of graphs and its application to WSN covering problems
From MaRDI portal
Publication:2036024
DOI10.1155/2021/5526532zbMath1477.05140OpenAlexW3155585439MaRDI QIDQ2036024
Jumei Yue, He Deng, Yongyi Yan
Publication date: 28 June 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/5526532
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Multilinear algebra, tensor calculus (15A69)
Related Items (1)
Cites Work
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- Stable sets versus independent sets
- On graphs with the third largest number of maximal independent sets
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges
- Enhancing an algorithm for set covering problems
- Observability of switched Boolean control networks using algebraic forms
- On the stabilization of nondeterministic finite automata via static output feedback
- A congestion game framework for service chain composition in NFV with function benefit
- Properly Colored Connectivity of Graphs
- Categorization Problem on Controllability of Boolean Control Networks
- Induced-Equations-Based Stability Analysis and Stabilization of Markovian Jump Boolean Networks
- Automata, Languages and Programming
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Matrix formulation of EISs of graphs and its application to WSN covering problems
