scientific article
From MaRDI portal
Publication:3691778
zbMath0573.05049MaRDI QIDQ3691778
John Frederick Fink, Michael S. Jacobson
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
On proper (1,2)‐dominating sets in graphs ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ The Outer-Paired Domination of Graphs ⋮ Computational aspects of double dominating sequences in graphs ⋮ On minimum intersections of certain secondary dominating sets in graphs ⋮ Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes ⋮ Roman {2}-domination in Graphs and Graph Products ⋮ Unnamed Item ⋮ Roman \(\{2 \}\)-domination ⋮ Algorithms for vertex-partitioning problems on graphs with fixed clique-width. ⋮ A note on the k-tuple domination number of graphs ⋮ A new approach on locally checkable problems ⋮ Stratification and domination in graphs. II ⋮ The difference between the metric dimension and the determining number of a graph ⋮ On trees with equal 2-domination and 2-outer-independent domination numbers ⋮ On approximating (connected) 2-edge dominating set by a tree ⋮ Unnamed Item ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ On the complexity of reinforcement in graphs ⋮ On the domination number of the Cartesian product of the cycle of length \(n\) and any graph ⋮ The annihilation number does not bound the 2-domination number from the above ⋮ On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs ⋮ Bounds on the connected \(k\)-domination number in graphs ⋮ Graphs with \(\alpha _1\) and \(\tau _1\) both large ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ Trees with maximum \(p\)-reinforcement number ⋮ The 2-domination number of cylindrical graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ A study of 3-arc graphs ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ Bounds on the \(k\)-domination number of a graph ⋮ Stratification and domination in graphs ⋮ 2-(edge-)connected edge domination number and matching number ⋮ Double vertex-edge domination ⋮ On bondage numbers of graphs: a survey with some comments ⋮ The exact 2-domination number of generalized Petersen graphs ⋮ Fair domination in graphs ⋮ Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number ⋮ Client-server and cost effective sets in graphs ⋮ A note on Nordhaus-Gaddum inequalities for domination. ⋮ Domination number, independent domination number and 2-independence number in trees ⋮ Generalized perfect domination in graphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ Algorithmic aspect of stratified domination in graphs ⋮ An upper bound on the 2-outer-independent domination number of a tree ⋮ Unnamed Item ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Irreversible conversion processes with deadlines ⋮ A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees ⋮ Ratios of some domination parameters in trees ⋮ NP-hardness of multiple bondage in graphs ⋮ New bounds on the \(k\)-domination number and the \(k\)-tuple domination number ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs ⋮ Independent sets in graphs ⋮ Exponential domination in subcubic graphs ⋮ A new generalization of kernels in digraphs ⋮ Subexponential fixed-parameter algorithms for partial vector domination ⋮ Irredundancy in circular arc graphs ⋮ 2-domination number of generalized Petersen graphs ⋮ \(F_3\)-domination problem of graphs ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ On the \(p\)-reinforcement and the complexity ⋮ On graphs with equal domination and 2-domination numbers ⋮ Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs ⋮ Fibonacci numbers in graphs with strong (1, 1, 2)-kernels ⋮ Some bounds on the \(p\)-domination number in trees ⋮ Italian domination of Cartesian products of directed cycles ⋮ The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products ⋮ A note on double domination in graphs ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Combinatorial bounds on paired and multiple domination in triangulations ⋮ Bounds on the exponential domination number ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs ⋮ A note on the global offensive alliances in graphs ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ \(k\)-tuple domination in graphs ⋮ Irredundance ⋮ The Private Neighbor Concept ⋮ Connected Domination ⋮ Multiple Domination ⋮ Distance Domination in Graphs ⋮ Rainbow Domination in Graphs ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ ANOTHER LOOK AT k-DOMINATION IN GRAPHS ⋮ Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number ⋮ 2-domination dot-stable and dot-critical graphs ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ A survey of stratified domination in graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ On the \(k\)-domination number of digraphs ⋮ Upper bounds for \(f\)-domination number of graphs ⋮ Interpolation theorems for domination numbers of a graph ⋮ Generalized independence and domination in graphs ⋮ On the complexity of multiple bondage in graphs ⋮ On \([j, k\)-sets in graphs]
This page was built for publication:
