scientific article
From MaRDI portal
Publication:2770439
zbMath1011.05045MaRDI QIDQ2770439
Publication date: 7 February 2002
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 (12)
A note on non-dominating set partitions in graphs ⋮ On total domination in the Cartesian product of graphs ⋮ An algorithm to check the equality of total domination number and double of domination number in graphs ⋮ Domination and total domination in cubic graphs of large girth ⋮ On total domination and minimum maximal matchings in graphs ⋮ Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs ⋮ Total domination versus domination in cubic graphs ⋮ On trees with unique locating kernels ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Relating ordinary and total domination in cubic graphs of large girth ⋮ Bondage numbers of Mycielski graphs ⋮ A survey of selected recent results on total domination in graphs
This page was built for publication:
