Minimum vertex-edge dominating set of permutation graphs
From MaRDI portal
Cites work
- R -Domination in Graphs
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- A note on independent vertex-edge domination in graphs
- A survey on the domination of fuzzy graphs
- Algorithmic graph theory and perfect graphs
- An efficient algorithm to find next-to-shortest path on permutation graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- An optimal greedy heuristic to color interval graphs
- Bounds on the sum of domination number and metric dimension of graphs
- Bounds on the vertex-edge domination number of a tree
- Bounds on total edge domination number of a tree
- Breadth-first traversal of trees and integer sorting in parallel
- Computation of diameter, radius and center of permutation graphs
- Depth-First Search and Linear Graph Algorithms
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Domination critical graphs
- Double vertex-edge domination
- Global vertex-edge domination sets in graph
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 1248191 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1472188 (Why is no real title available?)
- Inverse roman domination in graphs
- k-Efficient domination: Algorithmic perspective
- Line-set domination in graphs
- Linear programming approach for various domination parameters
- On the algorithmic complexity of double vertex-edge domination in graphs
- On vertex-edge and independent vertex-edge domination
- The outer-connected vertex edge domination number of a tree
- Total Domination Edge Critical Graphs with Maximum Diameter
- Total domination in graphs
- Total vertex-edge domination
- Vertex criticality with respect to isolate domination
- Vertex-edge domination
- Vertex-edge domination in cubic graphs
- Vertex-edge domination in graphs
- Vertex-edge domination in graphs
- Vertex-edge domination in unit disk graphs
This page was built for publication: Minimum vertex-edge dominating set of permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250416)