scientific article
From MaRDI portal
Publication:3815323
zbMath0664.05027MaRDI QIDQ3815323
Anthony E. Barkauskas, David W. Bange, Peter J. Slater
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (81)
On the efficiency index of a graph ⋮ On generalized Sierpiński graphs ⋮ A recurrence template for several parameters in series-parallel graphs ⋮ Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Efficient domination through eigenvalues ⋮ Irredundance perfect graphs ⋮ Efficient location of resources in cylindrical networks ⋮ Efficient domination in Cayley graphs of generalized dihedral groups ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ $k$-Efficient partitions of graphs ⋮ Structure of squares and efficient domination in graph classes ⋮ A Taxonomy of Perfect Domination ⋮ ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ The weighted perfect domination problem and its variants ⋮ On minimum intersection of two minimum dominating sets of interval graphs ⋮ Efficient domination of the orientations of a graph ⋮ Weighted domination of cocomparability graphs ⋮ Generalized domination and efficient domination in graphs ⋮ Every grid has an independent \([1, 2\)-set] ⋮ Relations between edge removing and edge subdivision concerning domination number of a graph ⋮ Colouring a dominating set without conflicts: \(q\)-subset square colouring ⋮ Some Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating Sets ⋮ Efficient minus and signed domination in graphs ⋮ Extended formulations for perfect domination problems and their algorithmic implications ⋮ k-Efficient domination: Algorithmic perspective ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ A generalization of Lee codes ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Unnamed Item ⋮ Lattice-like total perfect codes ⋮ On efficiently total dominatable digraphs ⋮ A self-stabilizing algorithm for optimally efficient sets in graphs ⋮ Self-stabilizing algorithms for efficient sets of graphs and trees ⋮ \([1,2\)-sets in graphs] ⋮ On minimum dominating sets with minimum intersection ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ Domination in rose window graphs ⋮ On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs ⋮ Queen's domination using border squares and \((A,B)\)-restricted domination ⋮ Roman dominating influence parameters ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Efficient sets in graphs ⋮ Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Efficient domination for classes of \(P_6\)-free graphs ⋮ Common extremal graphs for three inequalities involving domination parameters ⋮ 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_1, H_2)\)-free graphs ⋮ Algorithms for unipolar and generalized split graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ Varieties of Roman Domination ⋮ Fractional Dominating Parameters ⋮ Roman Domination in Graphs ⋮ Solving the weighted efficient edge domination problem on bipartite permutation graphs ⋮ Roman domination in regular graphs ⋮ Minimum fractional dominating functions and maximum fractional packing functions ⋮ Reinforcement numbers of digraphs ⋮ Unnamed Item ⋮ An overview of \((\kappa, \tau)\)-regular sets and their applications ⋮ A Survey of the Game “Lights Out!” ⋮ Real and integer domination in graphs ⋮ Parity dimension for graphs ⋮ On efficient domination for some classes of \(H\)-free bipartite graphs ⋮ Perfect codes in the discrete simplex ⋮ Rainbow perfect domination in lattice graphs ⋮ Coloring a dominating set without conflicts: \(q\)-subset square coloring ⋮ Efficient dominating sets in labeled rooted oriented trees ⋮ Broadcasts 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 ⋮ Efficient \((j, k)\)-dominating functions ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ On the edge geodetic and edge geodetic domination numbers of a graph
This page was built for publication:
