未找到相关数据
The Diameters of Some Transition Graphs Constructed from Hamilton Cycles
被引：0
作者：
Mariko Hagita
Yoshiaki Oda
Katsuhiro Ota
机构：
[1] Department of Mathematics,
[2] Faculty of Science and Technology,undefined
[3] Keio University,undefined
[4] 3-14-1 Hiyoshi,undefined
[5] Kohoku-ku,undefined
[6] Yokohama 223-8522,undefined
[7] Japan e-mail: hagita@comb.math.keio.ac.jp,undefined
[8] Department of Mathematics,undefined
[9] Faculty of Science and Technology,undefined
[10] Keio University,undefined
[11] 3-14-1 Hiyoshi,undefined
[12] Kohoku-ku,undefined
[13] Yokohama 223-8522,undefined
[14] Japan e-mail: oda@comb.math.keio.ac.jp,undefined
[15] Department of Mathematics,undefined
[16] Faculty of Science and Technology,undefined
[17] Keio University,undefined
[18] 3-14-1 Hiyoshi,undefined
[19] Kohoku-ku,undefined
[20] Yokohama 223-8522,undefined
[21] Japan e-mail: ohta@comb.math.keio.ac.jp,undefined
来源：
Graphs and Combinatorics
|
2002年
/
18卷
关键词：
Hamilton Cycle;
Transition Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A complete undirected graph of order n has \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}\end{document} Hamilton cycles. We consider the diameter of a transition graph whose vertices correspond to those Hamilton cycles and any of two vertices are adjacent if and only if the corresponding Hamilton cycles can be transformed each other by exchanging two edges. Moreover, we consider several transition graphs related to it.
引用
收藏
页码：105 / 117
页数：12
相关论文