Paired Domination Number of Graphs with Two Forbidden Subgraphs
The bound of graph parameters under the condition of forbidden subgraphs is an important part of graph theory research.Let D be a subset of V.If every vertex not in D is adjacent to a vertex in D,then D is a dominating set of G.If a dominating set D of a graph G without isolated vertices con-tains a perfect matching,then D is a paired dominating set of G.The paired domination number of G,is the minimum cardinality of all paired dominating sets.In this paper,we show a tight bound for a connected Claw-free and Eiffel-free graph G with order n.The results of this paper enrich the study of pairwise control domination numbers of graphs.
NETL
NSTL
万方数据
