scientific article; zbMATH DE number 975419
From MaRDI portal
Publication:5284096
zbMath0862.05064MaRDI QIDQ5284096
Marilynn L. Livingston, Quentin F. Stout
Publication date: 19 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (51)
A dichotomy for weighted efficient dominating sets with bounded degree vertices ⋮ \((1, j)\)-set problem in graphs ⋮ Weighted efficient domination problem on some perfect graphs ⋮ The fullerene graphs with a perfect star packing ⋮ Efficient domination in circulant graphs with two chord lengths ⋮ Efficient domination through eigenvalues ⋮ Efficient location of resources in cylindrical networks ⋮ A new upper bound for the perfect Italian domination number of a tree ⋮ Total perfect codes in Cayley graphs ⋮ A Taxonomy of Perfect Domination ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ The weighted perfect domination problem and its variants ⋮ Hereditary Efficiently Dominatable Graphs ⋮ Weighted domination of cocomparability graphs ⋮ Identifying codes on directed de Bruijn graphs ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ Every grid has an independent \([1, 2\)-set] ⋮ k-Efficient domination: Algorithmic perspective ⋮ A characterization of perfect Roman trees ⋮ On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Unnamed Item ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ Independent [1,2-domination of grids via min-plus algebra] ⋮ Efficient dominating sets in circulant graphs ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Unnamed Item ⋮ Algorithms for unipolar and generalized split graphs ⋮ Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh ⋮ Varieties of Roman Domination ⋮ Finding Lean Induced Cycles in Binary Hypercubes ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ On perfect Lee codes ⋮ A Survey of the Game “Lights Out!” ⋮ Perfect domination ratios of Archimedean lattices ⋮ Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices ⋮ On perfect and quasiperfect dominations in graphs ⋮ Rainbow perfect domination in lattice graphs ⋮ Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs ⋮ Outer complete fair domination in graphs ⋮ Efficient \((j, k)\)-dominating functions ⋮ Equitable fair domination in graphs ⋮ Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
This page was built for publication:
