| Issue |
MATEC Web Conf.
Volume 189, 2018
2018 2nd International Conference on Material Engineering and Advanced Manufacturing Technology (MEAMT 2018)
|
|
|---|---|---|
| Article Number | 03029 | |
| Number of page(s) | 7 | |
| Section | Cloud & Network | |
| DOI | https://doi.org/10.1051/matecconf/201818903029 | |
| Published online | 10 August 2018 | |
Γ -Paired dominating graphs of some paths
Department of Mathematics and Statistics, Faculty of Science and Technology, Thammasat University, Thailand
Corresponding author: n.trakultraipruk@yahoo.com
A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every vertex is adjacent to some vertex in D, and the subgraph of G induced by D contains a perfect matching. The upper paired domination number of G, denoted by Γpr(G) is the maximum cardinality of a minimal paired dominating set of G. A paired dominatin set of cardinality Γ pr(G) is called a Γpr(G) -set. The Γ -paired dominating graph of G, denoted by ΓPD(G), is the graph whose vertex set is the set of all Γ pr(G) -sets, and two Γpr(G) -sets are adjacentin ΓPD(G) if one can be obtained from the other by removing one vertex and adding another vertex of G. In this paper, we present the Γ-paired dominating graphs of some paths.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.