scientific article

From MaRDI portal
Revision as of 08:24, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)

Roman \(\{2 \}\)-dominationAlgorithms for vertex-partitioning problems on graphs with fixed clique-width.A note on the k-tuple domination number of graphsA new approach on locally checkable problemsStratification and domination in graphs. IIThe difference between the metric dimension and the determining number of a graphOn trees with equal 2-domination and 2-outer-independent domination numbersOn approximating (connected) 2-edge dominating set by a treeUnnamed ItemFrom Italian domination in lexicographic product graphs to w-domination in graphsOn the complexity of reinforcement in graphsOn the domination number of the Cartesian product of the cycle of length \(n\) and any graphThe annihilation number does not bound the 2-domination number from the aboveOn the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphsBounds on the connected \(k\)-domination number in graphsGraphs with \(\alpha _1\) and \(\tau _1\) both largeDomination parameters with number 2: interrelations and algorithmic consequencesRelating the annihilation number and the 2-domination number of a treeOn the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independenceTrees with maximum \(p\)-reinforcement numberThe 2-domination number of cylindrical graphsData reductions and combinatorial bounds for improved approximation algorithmsA study of 3-arc graphs\(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systemsBounds on the \(k\)-domination number of a graphStratification and domination in graphs2-(edge-)connected edge domination number and matching numberDouble vertex-edge dominationOn bondage numbers of graphs: a survey with some commentsThe exact 2-domination number of generalized Petersen graphsFair domination in graphsBounds of signless Laplacian spectrum of graphs based on the \(k\)-domination numberClient-server and cost effective sets in graphsA note on Nordhaus-Gaddum inequalities for domination.Domination number, independent domination number and 2-independence number in treesGeneralized perfect domination in graphsOn upper bounds for multiple domination numbers of graphsAlgorithmic aspect of stratified domination in graphsAn upper bound on the 2-outer-independent domination number of a treeUnnamed ItemOn \(k\)-domination and \(j\)-independence in graphsIrreversible conversion processes with deadlinesA note on the independence number, domination number and related parameters of random binary search trees and random recursive treesRatios of some domination parameters in treesNP-hardness of multiple bondage in graphsNew bounds on the \(k\)-domination number and the \(k\)-tuple domination numberRelating the annihilation number and the 2-domination number of block graphsImproved distributed local approximation algorithm for minimum 2-dominating set in planar graphsIndependent sets in graphsExponential domination in subcubic graphsA new generalization of kernels in digraphsSubexponential fixed-parameter algorithms for partial vector dominationIrredundancy in circular arc graphs2-domination number of generalized Petersen graphs\(F_3\)-domination problem of graphsMaximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjectureOn the \(p\)-reinforcement and the complexityOn graphs with equal domination and 2-domination numbersComplexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphsFibonacci numbers in graphs with strong (1, 1, 2)-kernelsSome bounds on the \(p\)-domination number in treesItalian domination of Cartesian products of directed cyclesThe <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph productsA note on double domination in graphsThe Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-dominationCombinatorial bounds on paired and multiple domination in triangulationsBounds on the exponential domination numberCombinatorial properties of a general domination problem with parity constraintsDistributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphsA note on the global offensive alliances in graphsRoman \(\{k\}\)-domination in trees and complexity results for some classes of graphsBounds on weak Roman and 2-rainbow domination numbers\(k\)-tuple domination in graphsIrredundanceThe Private Neighbor ConceptConnected DominationMultiple DominationDistance Domination in GraphsRainbow Domination in GraphsBipartite graphs with close domination and \(k\)-domination numbersANOTHER LOOK AT k-DOMINATION IN GRAPHSUpper bounds on the \(k\)-domination number and the \(k\)-Roman domination number2-domination dot-stable and dot-critical graphsIndependent \((k + 1)\)-domination in \(k\)-treesA survey of stratified domination in graphsNew algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphsOn the \(k\)-domination number of digraphsUpper bounds for \(f\)-domination number of graphsInterpolation theorems for domination numbers of a graphGeneralized independence and domination in graphsOn the complexity of multiple bondage in graphsOn \([j, k\)-sets in graphs] ⋮ Stratification and domination in graphs with minimum degree twoA simple optimal algorithm for \(k\)-tuple dominating problem in interval graphsThe sequence of upper and lower domination, independence and irredundance numbers of a graphEdge dominating set and colorings on graphs with fixed clique-widthBibliography on domination in graphs and some basic definitions of domination parametersThe k-neighbor domination problemTrees with 2-reinforcement number threeOn proper (1,2)‐dominating sets in graphs






This page was built for publication: