File: make_kautz_graph.Rd

package info (click to toggle)
r-cran-igraph 2.1.4-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 27,044 kB
  • sloc: ansic: 204,981; cpp: 21,711; fortran: 4,090; yacc: 1,229; lex: 519; sh: 52; makefile: 8
file content (49 lines) | stat: -rw-r--r-- 1,432 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/make.R
\name{make_kautz_graph}
\alias{make_kautz_graph}
\alias{kautz_graph}
\title{Kautz graphs}
\usage{
make_kautz_graph(m, n)

kautz_graph(...)
}
\arguments{
\item{m}{Integer scalar, the size of the alphabet. See details below.}

\item{n}{Integer scalar, the length of the labels. See details below.}

\item{...}{Passed to \code{make_kautz_graph()}.}
}
\value{
A graph object.
}
\description{
Kautz graphs are labeled graphs representing the overlap of strings.
}
\details{
A Kautz graph is a labeled graph, vertices are labeled by strings of length
\code{n+1} above an alphabet with \code{m+1} letters, with the restriction
that every two consecutive letters in the string must be different. There is
a directed edge from a vertex \code{v} to another vertex \code{w} if it is
possible to transform the string of \code{v} into the string of \code{w} by
removing the first letter and appending a letter to it.

Kautz graphs have some interesting properties, see e.g. Wikipedia for
details.
}
\examples{

make_line_graph(make_kautz_graph(2, 1))
make_kautz_graph(2, 2)

}
\seealso{
\code{\link[=make_de_bruijn_graph]{make_de_bruijn_graph()}}, \code{\link[=make_line_graph]{make_line_graph()}}
}
\author{
Gabor Csardi \href{mailto:csardi.gabor@gmail.com}{csardi.gabor@gmail.com}, the first version in R was
written by Vincent Matossian.
}
\keyword{graphs}