Do Almost All Trees Have No Perfect Dominating Set?

• 作 者: Bill Quan Yue
• 机 构: Sarasota
• 出 处: 离散数学期刊(英文)
• 发表日期: 2018年1期
• 关键词: TREE Dominating GRAPH GENERATING Function TreeDominatingGraphGenerating Function

A graph G is said to have a perfect dominating set S if S is a set of vertices of G and for each vertex v of G, either v is in S and v is adjacent to no other vertex in S, or v is not in S but is adjacent to precisely one vertex of S. A graph G may have n