Vertex-edge domination
From MaRDI portal
Recommendations
Cited in
(44)- A note on independent vertex-edge domination in graphs
- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
- Results on vertex-edge and independent vertex-edge domination
- Vertex-edge domination in cubic graphs
- Dominating vertex covers: the vertex-edge domination problem
- Vertices belonging to all or to no minimum vertex-edge dominating sets in trees
- On ve-degrees and ev-degrees in graphs
- Bounds on the vertex-edge domination number of a tree
- On trees with total domination number equal to edge-vertex domination number plus one
- Total domination and vertex-edge domination in tres
- scientific article; zbMATH DE number 4008449 (Why is no real title available?)
- The outer-connected vertex edge domination number of a tree
- Trees with vertex-edge Roman domination number twice the domination number minus one
- Total vertex-edge domination in trees
- Total vertex-edge domination
- Vertex-edge Roman domination
- scientific article; zbMATH DE number 7481760 (Why is no real title available?)
- The outer-connected vertex edge domination number in Cartesian product graphs
- scientific article; zbMATH DE number 7528064 (Why is no real title available?)
- scientific article; zbMATH DE number 6749458 (Why is no real title available?)
- Double vertex-edge domination
- A lower bound on the total vertex-edge domination number of a tree
- Vertex-edge domination in graphs
- Vertex-edge domination in unit disk graphs
- Vertex-edge domination in graphs
- Graphs with unique minimum vertex-edge dominating sets
- On a variant of vertex edge domination
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- \( M_{v e}\)-polynomial of cog-special graphs and types of fan graphs
- Total outer connected vertex-edge domination
- Disjoint isolating sets and graphs with maximum isolation number
- Algorithmic aspects of total vertex-edge domination in graphs
- On vertex-edge and edge-vertex connectivity indices of graphs
- Vertex-edge domination dot critical graphs
- The independent isolation number of a tree
- Well \textit{ve}-covered graphs
- Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs
- Bounds on independent isolation in graphs
- Vertex-edge domination in interval and bipartite permutation graphs
- On total isolation in graphs
- Minimum vertex-edge dominating set of permutation graphs
- Independence and domination on bounded-treewidth graphs: integer, rational, and irrational distances
- Isolation number: Cartesian and lexicographic products and generalized Sierpiński graphs
This page was built for publication: Vertex-edge domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059032)
