Edge weighting functions on semitotal dominating sets
type: Item
instance of: scholarly article
title: Edge weighting functions on semitotal dominating sets
zbMATH Open document ID: 1441.05171
author: Michael A. Henning
published in: Graphs and Combinatorics
publication date: 2017-08-10T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6759405
zbMATH Keywords: upper semitotal domination
zbMATH Keywords: regular graphs
MaRDI profile type: Publication
full work available at URL: s00373-017-1769-4
OpenAlex ID: W2586264719
cites work: Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
cites work: On the upper total domination number of Cartesian products of graphs
cites work: On the computational complexity of upper total domination
cites work: Upper total domination in claw‐free graphs
cites work: Vertex criticality for upper domination and irredundance
cites work: Upper domination and upper irredundance perfect graphs
cites work: Semitotal domination in graphs
cites work: Q4368728
cites work: On matching and semitotal domination in graphs
cites work: Vertices contained in all or in no minimum semitotal dominating set of a tree
cites work: Semitotal domination in claw-free cubic graphs
cites work: Locating-total domination in claw-free cubic graphs
cites work: Total Domination in Graphs
cites work: Edge Weighting Functions on Dominating Sets
cites work: A semi-induced subgraph characterization of upper domination perfect graphs
DOI: 10.1007/S00373-017-1769-4
description: scientific article; zbMATH DE number 6759405