|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| [[File:Kautz graph 32 33.svg|right|400px|thumb|Example of '''Kautz graph''' on 3 characters with string length 2 (on the left) and 3 (on the right); the edges on the left correspond to the vertices on the right.]]
| | Hello and welcome. My title is Irwin and I completely dig that name. Doing ceramics is what her family members and her enjoy. For many years he's been working as a receptionist. Years in the past we moved to North Dakota and I adore each working day residing here.<br><br>Visit my web page ... [http://www.neweracinema.com/tube/user/KOPR home std test kit] |
| | |
| The '''Kautz graph''' <math>K_M^{N + 1}</math> is a
| |
| [[directed graph]] of degree <math>M</math> and dimension <math>N+
| |
| 1</math>, which has <math>(M +1)M^{N}</math> vertices labeled by all
| |
| possible strings <math>s_0 \cdots s_N</math> of length <math>N +
| |
| 1</math> which are composed of characters <math>s_i</math> chosen from
| |
| an alphabet <math>A</math> containing <math>M + 1</math> distinct
| |
| symbols, subject to the condition that adjacent characters in the
| |
| string cannot be equal (<math>s_i \neq s_{i+ 1}</math>).
| |
| | |
| The Kautz graph <math>K_M^{N + 1}</math> has <math>(M + 1)M^{N
| |
| + 1}</math> edges
| |
| | |
| <math>\{(s_0 s_1 \cdots s_N,s_1 s_2 \cdots s_N s_{N + 1})| \; s_i \in A \; s_i \neq s_{i + 1} \} \, </math>
| |
| | |
| It is natural to label each such edge of <math>K_M^{N + 1}</math>
| |
| as <math>s_0s_1 \cdots s_{N + 1}</math>, giving a one-to-one correspondence
| |
| between edges of the Kautz graph <math>K_M^{N + 1}</math>
| |
| and vertices of the Kautz graph | |
| <math>K_M^{N + 2}</math>.
| |
| | |
| Kautz graphs are closely related to [[De Bruijn graph]]s.
| |
| | |
| == Properties ==
| |
| * For a fixed degree <math>M</math> and number of vertices <math>V = (M + 1) M^N</math>, the Kautz graph has the smallest [[Distance_(graph_theory)|diameter]] of any possible directed graph with <math>V</math> vertices and degree <math>M</math>.
| |
| | |
| * All Kautz graphs have [[Eulerian cycle]]s. (An Eulerian cycle is one which visits each edge exactly once-- This result follows because Kautz graphs have in-degree equal to out-degree for each node)
| |
| | |
| * All Kautz graphs have a [[Hamiltonian cycle]] (This result follows from the correspondence described above between edges of the Kautz graph <math>K_M^{N}</math> and vertices of the Kautz graph <math>K_M^{N + 1}</math>; a Hamiltonian cycle on <math>K_M^{N + 1}</math> is given by an Eulerian cycle on <math>K_M^{N}</math>)
| |
| | |
| * A degree-<math>k</math> Kautz graph has <math>k</math> disjoint paths from any node <math>x</math> to any other node <math>y</math>.
| |
| | |
| == In computing ==
| |
| The Kautz graph has been used as a [[network topology]] for connecting processors in [[high-performance computing]]<ref>{{cite web | url=http://pl.atyp.us/wordpress/?p=1275 | title=The Kautz Graph | author=Darcy, Jeff | date=2007-12-31 | publisher=[http://pl.atyp.us/wordpress/ Canned Platypus]}}</ref> and [[fault-tolerant computing]]<ref>{{cite conference |first=Dongsheng |last=Li |coauthors=Xicheng Lu, Jinshu Su |title=Graph-Theoretic Analysis of Kautz Topology and DHT Schemes |booktitle=Network and Parallel Computing: IFIP International Conference |pages=308–315 |publisher=NPC |date=2004 |location=Wuhan, China |url=http://books.google.com/books?id=DpDwhffRCjwC&pg=PA308&lpg=PA308&dq=kautz+graph&source=web&ots=QWy7s3YiHU&sig=KHsfzBYxBWdiNjZ4pn8YUoArB0A&hl=en |accessdate=2008-03-05 | isbn=3-540-23388-1 }}</ref> applications: such a network is known as a ''Kautz network''.
| |
| | |
| == Notes ==
| |
| {{reflist}}
| |
| | |
| {{PlanetMath attribution|id=8526|title=Kautz graph}}
| |
| | |
| {{DEFAULTSORT:Kautz Graph}}
| |
| [[Category:Parametric families of graphs]]
| |
| [[Category:Directed graphs]]
| |
Hello and welcome. My title is Irwin and I completely dig that name. Doing ceramics is what her family members and her enjoy. For many years he's been working as a receptionist. Years in the past we moved to North Dakota and I adore each working day residing here.
Visit my web page ... home std test kit