Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.10, Iss.3, 2005-11, pp. : 283-294

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

Vertices contained in all minimum paired-dominating sets of a tree

By Chen Xue-gang

Czechoslovak Mathematical Journal, Vol. 57, Iss. 1, 2007-03 ,pp. : 407-417

Springer Publishing Company

Access to resources Recommend Favorite

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

By Panda B. Pradhan D.

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 770-785

Springer Publishing Company

Access to resources Recommend Favorite

Which trees have a differentiating-paired dominating set?

By Henning Michael

Journal of Combinatorial Optimization, Vol. 22, Iss. 1, 2011-07 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

A Spanning Tree with High Degree Vertices

By Ozeki Kenta Yamashita Tomoki

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 591-596

Springer Publishing Company

Access to resources Recommend Favorite

A Note on Balancedness of Dominating Set Games

By Fang Qizhi Kim Hye

Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. : 303-310

Springer Publishing Company

Access to resources Recommend Favorite