Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory

DOI10.1155/2021/7230661zbMath1477.05118OpenAlexW3181196101MaRDI QIDQ2240198

He Deng, Yongyi Yan, Jumei Yue

Publication date: 8 November 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/7230661

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Unnamed Item
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• Optimal control of Boolean control networks with average cost: a policy iteration approach
• Matrix formulation of EISs of graphs and its application to WSN covering problems
• Set stability of switched delayed logical networks with application to finite-field consensus
• Finite-time pinning stabilization of Markovian jump Boolean networks
• Cascading state-space decomposition of Boolean control networks by nested method
• Determination of fuzzy internal stable, external stable sets, and kernels of fuzzy oriented graphs
• Stabilization of probabilistic Boolean networks via pinning control strategy
• Stability and Stabilization of Boolean Networks with Stochastic Delays
• Properly Colored Connectivity of Graphs
• Generalized Boolean Algebras and Applications
• Observability of Boolean networks via STP and graph methods
• Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling