scientific article; zbMATH DE number 4085682
From MaRDI portal
Publication:3815323
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient edge domination in regular graphs
- Roman domination in regular graphs
- Minimum fractional dominating functions and maximum fractional packing functions
- Reinforcement numbers of digraphs
- Generalized domination and efficient domination in graphs
- On minimum dominating sets with minimum intersection
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Real and integer domination in graphs
- Efficient edge domination problems in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- A recurrence template for several parameters in series-parallel graphs
- Weighted efficient domination problem on some perfect graphs
- On minimum intersection of two minimum dominating sets of interval graphs
- Efficient domination of the orientations of a graph
- Weighted domination of cocomparability graphs
- Efficient minus and signed domination in graphs
- \(H\)-domination in graphs
- Parity dimension for graphs
- Perfect edge domination and efficient edge domination in graphs
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient location of resources in cylindrical networks
- Bounding the open \(k\)-monopoly number of strong product graphs
- On efficiently total dominatable digraphs
- Efficient absorbants in generalized de Bruijn digraphs
- Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Irredundance perfect graphs
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Worst-case efficient dominating sets in digraphs
- On bondage numbers of graphs: a survey with some comments
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
- Efficient domination for classes of \(P_6\)-free graphs
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Efficient \((j, k)\)-dominating functions
- Efficient domination in Cayley graphs of generalized dihedral groups
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Domination in rose window graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- On efficient domination for some classes of H-free bipartite graphs
- Perfect codes in the discrete simplex
- On generalized Sierpiński graphs
- Efficient domination in knights graphs
- Every grid has an independent \([1, 2]\)-set
- Relations between edge removing and edge subdivision concerning domination number of a graph
- When an optimal dominating set with given constraints exists
- A generalization of Lee codes
- Lattice-like total perfect codes
- Self-stabilizing algorithms for efficient sets of graphs and trees
- \([1,2]\)-sets in graphs
- Roman dominating influence parameters
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Efficient dominating sets in labeled rooted oriented trees
- Broadcasts in graphs
- On the efficiency index of a graph
- A Survey of the Game “Lights Out!”
- Cost effective domination in graphs
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings
- On efficient dominating sets in simplicial graphs
- Efficient domination through eigenvalues
- Structure of squares and efficient domination in graph classes
- Varieties of Roman Domination
- Fractional dominating parameters
- Roman domination in graphs
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- Efficient (j,k)-domination
- Bi-efficient domination in graphs
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- scientific article; zbMATH DE number 637297 (Why is no real title available?)
- scientific article; zbMATH DE number 637310 (Why is no real title available?)
- scientific article; zbMATH DE number 1151809 (Why is no real title available?)
- Efficient domination in cubic vertex-transitive graphs
- Efficient total domination in digraphs
- A self-stabilizing algorithm for optimally efficient sets in graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Rainbow perfect domination in lattice graphs
- Semi square stable graphs and efficient dominating sets
- A Taxonomy of Perfect Domination
- ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES
- Common extremal graphs for three inequalities involving domination parameters
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- Some cycle and star related Nordhaus-Gaddum type relations on strong efficient dominating sets
- k-efficient partitions of graphs
- Hereditary efficiently dominatable graphs
- Recurrence among trees with most numerous efficient dominating sets
- Efficient 2-domination in trees
- scientific article; zbMATH DE number 2230323 (Why is no real title available?)
- On efficient domination for some classes of \(H\)-free chordal graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- Extremal problems related to the cardinality-redundance of graphs
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Extended formulations for perfect domination problems and their algorithmic implications
- k-Efficient domination: Algorithmic perspective
- Weighted domination on cocomparability graphs
- A resource assignment problem on graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815323)
