Equistable distance-hereditary graphs

Discrete Applied Mathematics（2008）

引用 15|浏览3

暂无评分

摘要

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a necessary condition for a graph to be equistable is sufficient when the graph in question is distance-hereditary. This is used to design a polynomial-time recognition algorithm for equistable distance-hereditary graphs.

查看译文

关键词

equistable distance-hereditary graph,equistable graphs,polynomial-time recognition algorithm,maximal stable,necessary condition,total weight,non-negative weight function,distance-hereditary graphs,polynomial time

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要