首页> 外文会议>Circuits and Systems, (APCCAS), 2006 IEEE Asia Pacific Conference on >Realizability of Score Sequence Pair of an (r1l, r12, r22)-Tournament
【24h】

Realizability of Score Sequence Pair of an (r1l, r12, r22)-Tournament

机译:(r11,r12,r22)-锦标赛的得分序列对的可实现性

获取原文

摘要

Let G be any directed graph and S be nonnegative and non-decreasing integer sequence(s). The prescribed degree sequence problem is a problem to determine whether there is a graph G with S as the prescribed sequence(s) of outdegrees of the vertices. Let G
机译:令G为任何有向图,S为非负且不减数的整数序列。规定度序列问题是确定是否存在以S作为顶点的度数的规定序列的图G的问题。让G

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号