๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Vertices in all minimum paired-dominating sets of

โœ Scribed by Lei Chen, Changhong Lu, Zhenbing Zeng

Book ID
118801969
Publisher
Springer US
Year
2011
Tongue
English
Weight
534 KB
Volume
24
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
โœ Jerzy Topp ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

Vertices contained in every minimum domi
Vertices contained in every minimum dominating set of a tree
โœ Mynhardt, C. M. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating se