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 graphOn generalized Sierpiński graphsA recurrence template for several parameters in series-parallel graphsNeighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ A dichotomy for weighted efficient dominating sets with bounded degree verticesWeighted efficient domination problem on some perfect graphsEfficient domination through eigenvaluesIrredundance perfect graphsEfficient location of resources in cylindrical networksEfficient domination in Cayley graphs of generalized dihedral groupsFurther progress on the total Roman \(\{2\}\)-domination number of graphs$k$-Efficient partitions of graphsStructure of squares and efficient domination in graph classesA Taxonomy of Perfect DominationON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICESWeighted independent perfect domination on cocomparability graphsThe weighted perfect domination problem and its variantsOn minimum intersection of two minimum dominating sets of interval graphsEfficient domination of the orientations of a graphWeighted domination of cocomparability graphsGeneralized domination and efficient domination in graphsEvery grid has an independent \([1, 2\)-set] ⋮ Relations between edge removing and edge subdivision concerning domination number of a graphColouring a dominating set without conflicts: \(q\)-subset square colouringSome Cycle and Star Related Nordhaus-Gaddum Type Relations on Strong Effcient Dominating SetsEfficient minus and signed domination in graphsExtended formulations for perfect domination problems and their algorithmic implicationsk-Efficient domination: Algorithmic perspectiveBounding the open \(k\)-monopoly number of strong product graphsA generalization of Lee codesOn bondage numbers of graphs: a survey with some commentsEfficient domination in cubic vertex-transitive graphsUnnamed ItemLattice-like total perfect codesOn efficiently total dominatable digraphsA self-stabilizing algorithm for optimally efficient sets in graphsSelf-stabilizing algorithms for efficient sets of graphs and trees\([1,2\)-sets in graphs] ⋮ On minimum dominating sets with minimum intersectionPolynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphsDomination in rose window graphsOn the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphsQueen's domination using border squares and \((A,B)\)-restricted dominationRoman dominating influence parametersThe bondage numbers and efficient dominations of vertex-transitive graphsGraphs that are simultaneously efficient open domination and efficient closed domination graphsEfficient absorbants in generalized de Bruijn digraphsEfficient sets in graphsDomination and efficient domination in cubic and quartic Cayley graphs on abelian groupsA tight bound on the number of mobile servers to guarantee transferability among dominating configurationsEfficient domination for classes of \(P_6\)-free graphsCommon extremal graphs for three inequalities involving domination parametersPolynomial-time algorithm for weighted efficient domination problem on diameter three planar graphsWeighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphsAlgorithms for unipolar and generalized split graphsOn efficient domination for some classes of \(H\)-free chordal graphsOn efficient domination for some classes of \(H\)-free chordal graphsVarieties of Roman DominationFractional Dominating ParametersRoman Domination in GraphsSolving the weighted efficient edge domination problem on bipartite permutation graphsRoman domination in regular graphsMinimum fractional dominating functions and maximum fractional packing functionsReinforcement numbers of digraphsUnnamed ItemAn overview of \((\kappa, \tau)\)-regular sets and their applicationsA Survey of the Game “Lights Out!”Real and integer domination in graphsParity dimension for graphsOn efficient domination for some classes of \(H\)-free bipartite graphsPerfect codes in the discrete simplexRainbow perfect domination in lattice graphsColoring a dominating set without conflicts: \(q\)-subset square coloringEfficient dominating sets in labeled rooted oriented treesBroadcasts in graphsEfficient edge domination problems in graphsPolynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphsThe sequence of upper and lower domination, independence and irredundance numbers of a graphEfficient \((j, k)\)-dominating functionsBibliography on domination in graphs and some basic definitions of domination parametersOn the edge geodetic and edge geodetic domination numbers of a graph




This page was built for publication: