รหัสดีโอไอ 10.14457/TU.the.2018.420
Title Γ-Induced-paired dominating graphs of paths
Creator Saharath Sanguanpong
Contributor Nantapath Trakultraipruk, Advisor
Publisher Thammasat University
Publication Year 2018
Keyword Induced-paired dominating set ,Induced paired domination number
Abstract Let D be a set of vertices of a graph G. Then D is called an induced-paired dominating set if every vertex in G is adjacent to some vertex in D and the subgraph of G induced by D contains only nonadjacent edges. The upper induced-paired domination number of G, denoted by Γ_ip(G), is the maximum cardinality of a minimal induced-paired dominating set of G. An induced-paired dominating set of cardinality Γ_ip(G) is called an Γ_ip(G)-set. We introduce the Γ-induced-paired dominating graph of G, denoted by IPD_Γ(G), to be the graph whose vertex set is the set of all Γ_ip(G)-sets, and two Γ_ip(G)-sets are adjacent in IPD_Γ(G) if one can be obtained from the other by removing one vertex and adding another vertex of G. In this thesis, we present the Γ-induced-paired dominating graphs of allpaths.
ดิจิตอลไฟล์ Digital File #1

บรรณานุกรม

Saharath Sanguanpong และผู้แต่งคนอื่นๆ. (2018) Γ-Induced-paired dominating graphs of paths. Thammasat University:ม.ป.ท.
Saharath Sanguanpong และผู้แต่งคนอื่นๆ. 2018. Γ-Induced-paired dominating graphs of paths. ม.ป.ท.:Thammasat University;
Saharath Sanguanpong และผู้แต่งคนอื่นๆ. Γ-Induced-paired dominating graphs of paths. ม.ป.ท.:Thammasat University, 2018. Print.