scientific article; zbMATH DE number 7489052
From MaRDI portal
Publication:5061786
DOI10.5666/KMJ.2021.61.3.661zbMath1482.05249MaRDI QIDQ5061786
Padamutham Chakradhar, Palagiri Venkata Subba Reddy
Publication date: 14 March 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting independent sets in tree convex bipartite graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Perfect Roman domination in trees
- Threshold graphs and related topics
- On perfect Roman domination number in trees: complexity and bounds
- Perfect Roman domination in graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Node-and edge-deletion NP-complete problems
- Algorithms and Computation
This page was built for publication:
