Name
Abstract | ||
|---|---|---|
Let D be a directed Eulerian multigraph, v be a vertex of D . We call the common value of id( v ) and od( v ) the degree of v , and simply denote it by d v . Xia introduced the concept of the T -transformation for directed Euler tours and proved that any directed Euler tour ( T )-transformation graph E u ( D ) is connected. Zhang and Guo proved that E u ( D ) is edge-Hamiltonian, i.e., any edge of E u ( D ) is contained in a Hamilton cycle of E u ( D ). In this paper, we obtain a lower bound Σ (d r −1)(d r −2) 2 r ϵ Q for the connectivity of E u ( D ), where Q = vϵV(D)¦d v ⩾ 2 . Examples are given to show that this lower bound is in some sense best possible. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/0012-365X(95)00313-L | Discrete Mathematics |
Keywords | Field | DocType |
transformation graph,connectivity,euler tour transformation graph,directed euler tour,common value,lower bound,hamilton cycle | Discrete mathematics,Graph,Combinatorics,Multigraph,Vertex (geometry),Upper and lower bounds,Hamiltonian path,Euler's formula,Eulerian path,Mathematics | Journal |
Volume | Issue | ISSN |
163 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.39 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xueliang Li | 1 | 1 | 0.39 |