scientific article; zbMATH DE number 3531438
From MaRDI portal
Publication:4108373
zbMath0341.05126MaRDI QIDQ4108373
No author found.
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
Improved bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ Domination type parameters of Pell graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Domination number of graphs with minimum degree five ⋮ Upper bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ On domination-type invariants of Fibonacci cubes and hypercubes ⋮ Rainbow edge-coloring and rainbow domination ⋮ 2-connected graphs with small 2-connected dominating sets. ⋮ Domination in commuting graph and its complement ⋮ A study of 3-arc graphs ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Estimations for the domination number of a graph ⋮ Unnamed Item ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ The upper bound on \(k\)-tuple domination numbers of graphs ⋮ On roman, global and restrained domination in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ A greedy partition lemma for directed domination ⋮ New bounds on the \(k\)-domination number and the \(k\)-tuple domination number ⋮ A generalised upper bound for the \(k\)-tuple domination number ⋮ The \(k\)-tuple domination number revisited ⋮ Partial domination - the isolation number of a graph ⋮ Some upper bounds for the product of the domination number and the chromatic number of a graph ⋮ Pebbling Graphs of Fixed Diameter ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ On restricted domination in graphs ⋮ On the geodetic and geodetic domination numbers of a graph ⋮ Domination in bipartite graphs ⋮ Efficiency in exponential time for domination-type problems ⋮ A sharp upper bound on the least signless Laplacian eigenvalue using domination number ⋮ Minimum partition of an independence system into independent sets ⋮ Multiple Domination ⋮ Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number ⋮ New probabilistic upper bounds on the domination number of a graph ⋮ Independent dominating sets in graphs of girth five ⋮ Domination number and neighbourhood conditions ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ On general frameworks and threshold functions for multiple domination ⋮ Algorithms and almost tight results for 3-colorability of small diameter graphs
This page was built for publication:
