Smallest domination number and largest independence number of graphs and forests with given degree sequence-Reference-Cited by-同舟云学术

Smallest domination number and largest independence number of graphs and forests with given degree sequence

Author:

Gentner Michael¹,Henning Michael A.²^ORCID,Rautenbach Dieter¹^ORCID

Affiliation:

1. Institute of Optimization and Operations Research; Ulm University; Ulm Germany

2. Department of Pure and Applied Mathematics; University of Johannesburg; Auckland Park 2006 South Africa

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference28 articles.

1. Best monotone degree bounds for various graph parameters;Bauer;Congr. Numerantium,2008

2. Bounding the domination number of a tree in terms of its annihilation number;Dehgardi;Trans. Comb.,2013

3. Bounding the rainbow domination number of a tree in terms of its annihilation number;Dehgardi;Trans. Comb.,2013

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Revisiting k-tuple Dominating Sets with Emphasis on Small Values of k;Bulletin of the Malaysian Mathematical Sciences Society;2022-03-25

3. On an annihilation number conjecture;Ars Mathematica Contemporanea;2020-10-23