首页> 美国政府科技报告 >Some Properties of Graphs with Local Ore Conditions
【24h】

Some Properties of Graphs with Local Ore Conditions

机译:局部矿石条件图的一些性质

获取原文

摘要

The author and N.K. Khachatrian proved that a connected graph G of order at least3 is hamiltonian if for each vertex x the subgraph G(sub 1)(x) induced by x and its neighbors in G is an Ore graph. We prove here that a graph G satisfying the above conditions is fully cycle extendable. Moreover, G is panconnected if and only if G is 3-connected and G does not = K(sub n) 'V' (K bar(sub n)) for some n = or > 3 where V is the join operation. The paper is concluded with two conjectures.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号