\(L(p,q)\)-label coloring problem with application to channel allocation
From MaRDI portal
Publication:778676
DOI10.1155/2020/5369859zbMath1459.05289OpenAlexW3033190535MaRDI QIDQ778676
Publication date: 3 July 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5369859
Cites Work
- Unnamed Item
- On robust control invariance of Boolean control networks
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- \(L(2,1)\)-labeling of interval graphs
- Stability and stabilization of a class of finite evolutionary games
- Set stability and set stabilization of Boolean control networks based on invariant subsets
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Further results on feedback stabilization control design of Boolean control networks
- Nonsingularity of feedback shift registers
- Sampled-data stabilization of probabilistic Boolean control networks
- \(l_{1}\)-gain analysis and model reduction problem for Boolean control networks
- Controllability of Markovian jump Boolean control networks
- Matrix approach to detectability of discrete event systems
- Controllability of Context-Sensitive Probabilistic Mix-Valued Logical Control Networks with Constraints
- A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks
- A Separator Theorem for Planar Graphs
- Labelling Graphs with a Condition at Distance 2
- Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks
- A Matrix Approach to the Analysis and Control of Networked Evolutionary Games with Bankruptcy Mechanism
- Output Regulation of Boolean Control Networks
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: \(L(p,q)\)-label coloring problem with application to channel allocation
