...
首页> 外文期刊>Journal of Graph Theory >GRAPHS WHOSE POWERS ARE CHORDAL AND GRAPHS WHOSE POWERS ARE INTERVAL GRAPHS
【24h】

GRAPHS WHOSE POWERS ARE CHORDAL AND GRAPHS WHOSE POWERS ARE INTERVAL GRAPHS

机译:权重是跨度的图,权重是区间图

获取原文
获取原文并翻译 | 示例

摘要

The main theorem of this paper gives a forbidden induced subgraph condition on G that is sufficient for chordality of G(m). This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for m = 2. We also give a forbidden subgraph condition on G that is sufficient for chordality of G(2m). Similar conditions on G that are sufficient for G(m) being an interval graph are also obtained. In addition it is easy to see, that no family of forbidden (induced) subgraphs of G is necessary for G(m) being chordal or interval graph. (C) 1997 John Wiley & Sons, Inc. [References: 7]
机译:本文的主要定理给出了在G上的诱导子图条件,该条件足以满足G(m)的弦性。该定理是Balakrishnan和Paulraja定理的推广,后者仅在m = 2时提供了该定理。我们还给出了G的一个足以满足G(2m)和弦性的禁止子图条件。还获得了足以满足G(m)作为间隔图的G的相似条件。此外,很容易看出,对于G(m)是弦图或间隔图,不需要G族的禁止(诱导)子图族。 (C)1997 John Wiley&Sons,Inc. [参考:7]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号