scientific article; zbMATH DE number 2108130
From MaRDI portal
Publication:4820525
zbMath1054.05081MaRDI QIDQ4820525
Erfang Shan, Michael A. Henning, Li-ying Kang
Publication date: 15 October 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Paired domination versus domination and packing number in graphs ⋮ An upper bound for the total restrained domination number of graphs ⋮ Dominating direct products of graphs ⋮ Construction for trees without domination critical vertices ⋮ Distance paired domination numbers of graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ 2-distance paired-dominating number of graphs ⋮ On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\) ⋮ Total restrained domination numbers of trees ⋮ Total outer-connected domination numbers of trees ⋮ Vertices contained in all or in no minimum paired-dominating set of a tree ⋮ Paired bondage in trees ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ Paired Domination in Graphs ⋮ Critical paired dominating sets and irreducible decompositions of powers of edge ideals ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph ⋮ Upper paired domination versus upper domination
This page was built for publication:
