证明了在任意n(≥5)维星图中去掉2n-9条边且使得去边后的图的每个点关联至少两条边,得到的图是边-哈密尔顿的.
In this paper,we show that for any n-dimensional star graph(n≥5) with≤2n-9 edge faults in which each node is incident to at least two fault-free edges,every fault-free edge lies on a Hamiltonian cycle.