Weakly connected domination stable trees

ISSN： 0011-4642

Source： Czechoslovak Mathematical Journal, Vol.59, Iss.1, 2009-03, pp. : 95-100

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

On the total outer-connected domination in graphs

By Favaron O. Karami H. Sheikholeslami S.

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 451-461

Springer Publishing Company

Access to resources Recommend Favorite

Constructing weakly connected dominating set for secure clustering in distributed sensor network

By Du Hongjie

Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. : 301-307

Springer Publishing Company

Access to resources Recommend Favorite

Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

By Guha S. Khuller S.

Information and Computation, Vol. 150, Iss. 1, 1999-04 ,pp. : 57-74

Academic Press

Access to resources Recommend Favorite

Remarks on restrained domination and total restrained domination in graphs

By Zelinka Bohdan

Czechoslovak Mathematical Journal, Vol. 55, Iss. 2, 2005-06 ,pp. : 393-396

Springer Publishing Company

Access to resources Recommend Favorite

Upper total domination versus upper paired-domination

By Dorbec Paul Henning Michael A. McCoy John

Quaestiones Mathematicae, Vol. 30, Iss. 1, 2007-03 ,pp. : 1-12

Taylor & Francis Ltd

Access to resources Recommend Favorite