On graphs having domination number half their order
type: Item
instance of: scholarly article
title: On graphs having domination number half their order
zbMATH Open document ID: 0602.05043
DOI: 10.1007/BF01848079
author: B. George
published in: Periodica Mathematica Hungarica
publication date: 1985-01-01T00:00:00Z
review text: There is known the conjecture of V. G. Vizing that \(\sigma\) (G\(\times H)\geq \sigma (G)\cdot \sigma (H)\), \(\sigma\) (G) being the domination number of graph G; though the authors have no solution to this open problem, they present a class of connected graphs of order 2n with domination number n, with the property that \(\sigma (G\times H)=\sigma (G)\cdot \sigma (H)\) for every two graphs G and H in this class.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3970792
zbMATH Keywords: product of graphs
zbMATH Keywords: domination number
Wikidata QID: Q56502748
MaRDI profile type: Publication
cites work: Towards a theory of domination in graphs
cites work: Q3680873
description: scientific article; zbMATH DE number 3970792