scientific article
From MaRDI portal
Publication:3691779
zbMath0573.05050MaRDI QIDQ3691779
Michael S. Jacobson, John Frederick Fink
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Algorithms for vertex-partitioning problems on graphs with fixed clique-width., A note on the k-tuple domination number of graphs, Augmenting approach for some maximum set problems, Deterministic bootstrap percolation on trees, The \(k\)-neighbor, \(r\)-domination problems on interval graphs, On approximating (connected) 2-edge dominating set by a tree, Claw-free graphs---a survey, On \(k\)-independence in graphs with emphasis on trees, The minimum number of vertices in uniform hypergraphs with given domination number, Independent Roman domination and 2-independence in trees, Bounds on the connected \(k\)-domination number in graphs, Graphs with \(\alpha _1\) and \(\tau _1\) both large, On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence, Roman domination and 2-independence in trees, On the super domination number of lexicographic product graphs, (Open) packing number of some graph products, Limited Packings 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, Client-server and cost effective sets in graphs, A note on Nordhaus-Gaddum inequalities for domination., Unnamed Item, Domination number, independent domination number and 2-independence number in trees, On \(k\)-domination and \(j\)-independence in graphs, \([1,2\)-sets in graphs], Ratios of some domination parameters in trees, \([1,k\)-domination number of lexicographic products of graphs], Unnamed Item, An upper bound for thek-domination number of a graph, Hamiltonicity in claw-free graphs, New bounds on the \(k\)-domination number and the \(k\)-tuple domination number, Bounds on the 2-domination number, Constructing dominating sets in circulant graphs, A new generalization of kernels in digraphs, Grundy dominating sequences and zero forcing sets, 2-domination number of generalized Petersen graphs, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, On the 2-independence subdivision number of graphs, On graphs with equal domination and 2-domination numbers, Mixed Roman domination and 2-independence in trees, Some bounds on the \(p\)-domination number in trees, 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, Combinatorial properties of a general domination problem with parity constraints, A note on the global offensive alliances in graphs, Bounds on weak Roman and 2-rainbow domination numbers, Multiple Domination, Bipartite graphs with close domination and \(k\)-domination numbers, Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number, Independent \((k + 1)\)-domination in \(k\)-trees, On the \(k\)-domination number of digraphs, Upper bounds for \(f\)-domination number of graphs, Generalized independence and domination in graphs, Edge domination and 2-independence in trees, Edge dominating set and colorings on graphs with fixed clique-width, Bibliography on domination in graphs and some basic definitions of domination parameters, On a conjecture of Fink and Jacobson concerning k-domination and k- dependence, Middle domination and 2-independence in trees, The k-neighbor domination problem
