Bounds on Domination Parameters in Graphs: A Brief Survey

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-06-29 DOI:10.7151/dmgt.2454

Michael A. Henning

引用次数: 1

Abstract

Abstract In this paper we present a brief survey of bounds on selected domination parameters. We focus primarily on bounds on domination parameters in terms of the order and minimum degree of the graph. We present a list of open problems and conjectures that have yet to be solved in the hope of attracting future researchers to the field.

查看原文本刊更多论文

图中支配参数的界限:简要综述

摘要在本文中，我们简要地考察了所选支配参数的界。我们主要关注根据图的阶和最小度的控制参数的界。我们列出了一系列尚未解决的悬而未决的问题和猜想，希望能吸引未来的研究人员进入该领域。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.