On average lower independence and domination numbers in graphs-Reference-Cited by-同舟云学术

On average lower independence and domination numbers in graphs

Published:2005-05 Issue:1-3 Volume:295 Page:1-11
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Blidia Mostafa,Chellali Mustapha,Maffray Frédéric

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. M. Blidia, M. Chellali, F. Maffray, Extremal graphs for a new upper bound on domination parameters in graphs, submitted for publication.

2. M. Blidia, M. Chellali, F. Maffray, On average lower independence and domination numbers in graphs, Research Report, Laboratoire Leibniz-IMAG, 2003, http://www-leibniz.imag.fr/LesCahiers.

3. Paths, trees and flowers;Edmonds;Canad. J. Math.,1965

4. On graphs having domination number half their order;Fink;Period. Math. Hungar.,1985

5. T.W. Haynes, S.T. Hedetniemi, P.J. Slater (Eds.), Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.

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

1. On Combining the Methods of Link Residual and Domination in Networks;Fundamenta Informaticae;2020-05-12

2. Average Secure Support Strong Domination in Graphs;Emerging Trends in Computing and Expert Technology;2019-11-07

3. Combining the Concepts of Residual and Domination in Graphs;Fundamenta Informaticae;2019-04-26

4. On the average lower bondage number of a graph;RAIRO - Operations Research;2016-10

5. The Average Lower 2-Domination Number of Wheels Related Graphs and an Algorithm;Mathematical and Computational Applications;2016-07-18