Generalization of the total outer-connected domination in graphs

E-ISSN： 1290-3868|50|2|233-239

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.50, Iss.2, 2016-03, pp. : 233-239

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An introduction to the twin signed total k-domination numbers in directed graphs

By Atapour Masoud Dehgardi Nasrin Volkmann L.

RAIRO - Operations Research, Vol. 51, Iss. 4, 2017-11 ,pp. : 1331-1343

Edp Sciences

Access to resources Recommend Favorite

Domination problems on P₅-free graphs∗

By Lin Min Chih Mizrahi Michel J.

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 5, 2015-01 ,pp. : 541-549

Edp Sciences

Access to resources Recommend Favorite

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗

By Laforest Christian Phan Raksmey

RAIRO - Operations Research, Vol. 47, Iss. 3, 2013-05 ,pp. : 199-221

Edp Sciences

Access to resources Recommend Favorite

Domination of Discrete Distributed Systems

ESAIM: Proceedings and surveys, Vol. 49, Iss. issue, 2015-03 ,pp. : 1-10

Edp Sciences

Access to resources Recommend Favorite

Are Food Webs Randomly Connected?

Ecology, Vol. 72, Iss. 5, 1991-10 ,pp. : 1794-1799

John Wiley & Sons Inc

Access to resources Recommend Favorite