About: Kautz graph

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Kautz graph Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Unit108189659, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FKautz_graph&invfp=IFP_OFF&sas=SAME_AS_OFF

The Kautz graph is a directed graph of degree and dimension , which has vertices labeled by allpossible strings of length which are composed of characters chosen froman alphabet containing distinctsymbols, subject to the condition that adjacent characters in thestring cannot be equal. The Kautz graph has edges It is natural to label each such edge of as , giving a one-to-one correspondencebetween edges of the Kautz graph and vertices of the Kautz graph. Kautz graphs are closely related to De Bruijn graphs.

Attributes	Values
rdf:type	yago:WikicatParametricFamiliesOfGraphs yago:Abstraction100002137 yago:Family108078020 yago:Group100031264 yago:Organization108008335 yago:YagoLegalActor yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity yago:SocialGroup107950920 yago:Unit108189659
rdfs:label	Kautz-Graph (de) Kautz graph (en) Граф Кауца (ru)
rdfs:comment	Der Kautz-Graph , benannt nach (* 1924), ist ein Digraph (gerichteter Graph) vom Grad und Dimension mit Ecken. Die Ecken sind bezeichnet mit allen möglichen Zeichenketten der Länge aus Zeichen des Alphabets , das unterschiedliche Symbole enthält, mit der Einschränkung, dass nebeneinander gelegene Zeichen in der Zeichenkette nicht gleich sein dürfen ( für ). Der Kautz-Graph hat gerichtete Kanten Normalerweise markiert man diese Kanten von mit, wodurch man eine 1:1-Entsprechung zwischen Kanten des Kautz-Graphen und Ecken des Kautz-Graphen erhält. Kautz-Graphen sind eng verwandt mit . (de) The Kautz graph is a directed graph of degree and dimension , which has vertices labeled by allpossible strings of length which are composed of characters chosen froman alphabet containing distinctsymbols, subject to the condition that adjacent characters in thestring cannot be equal. The Kautz graph has edges It is natural to label each such edge of as , giving a one-to-one correspondencebetween edges of the Kautz graph and vertices of the Kautz graph. Kautz graphs are closely related to De Bruijn graphs. (en) Граф Кауца — это ориентированный граф степени и размерности , который имеет вершин, помеченных всеми возможными строками длины , которые составлены из символов , выбранных из алфавита , содержащего различных символов с условием, что соседние символы не могут совпадать. Граф Кауца имеет рёбер Естественно пометить каждое такое ребро как , создавая один-к-одному соответствие между рёбрами графа Кауца и вершинами графа Кауца . Графы Кауца тесно связаны с графами де Брёйна. (ru)
foaf:depiction
dcterms:subject	Directed graphs Parametric families of graphs
Wikipage page ID	7815113 (xsd:integer)
Wikipage revision ID	1000093570 (xsd:integer)
Link from a Wikipage to another Wikipage	Eulerian cycle De Bruijn graph Network topology Directed graphs Parametric families of graphs Directed graph High-performance computing Distance (graph theory) Fault-tolerant computing Hamiltonian cycle
sameAs	Kautz graph Kautz graph Kautz graph Kautz graph Kautz graph Kautz graph Kautz graph
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:PlanetMath_attribution
thumbnail	wiki-commons:Special:FilePath/Kautz_graph_32_33.svg?width=300
id	8526 (xsd:integer)
title	Kautz graph (en)
has abstract	Der Kautz-Graph , benannt nach (* 1924), ist ein Digraph (gerichteter Graph) vom Grad und Dimension mit Ecken. Die Ecken sind bezeichnet mit allen möglichen Zeichenketten der Länge aus Zeichen des Alphabets , das unterschiedliche Symbole enthält, mit der Einschränkung, dass nebeneinander gelegene Zeichen in der Zeichenkette nicht gleich sein dürfen ( für ). Der Kautz-Graph hat gerichtete Kanten Normalerweise markiert man diese Kanten von mit, wodurch man eine 1:1-Entsprechung zwischen Kanten des Kautz-Graphen und Ecken des Kautz-Graphen erhält. Kautz-Graphen sind eng verwandt mit . (de) The Kautz graph is a directed graph of degree and dimension , which has vertices labeled by allpossible strings of length which are composed of characters chosen froman alphabet containing distinctsymbols, subject to the condition that adjacent characters in thestring cannot be equal. The Kautz graph has edges It is natural to label each such edge of as , giving a one-to-one correspondencebetween edges of the Kautz graph and vertices of the Kautz graph. Kautz graphs are closely related to De Bruijn graphs. (en) Граф Кауца — это ориентированный граф степени и размерности , который имеет вершин, помеченных всеми возможными строками длины , которые составлены из символов , выбранных из алфавита , содержащего различных символов с условием, что соседние символы не могут совпадать. Граф Кауца имеет рёбер Естественно пометить каждое такое ребро как , создавая один-к-одному соответствие между рёбрами графа Кауца и вершинами графа Кауца . Графы Кауца тесно связаны с графами де Брёйна. (ru)
prov:wasDerivedFrom	wikipedia-en:Kautz_graph?oldid=1000093570&ns=0
page length (characters) of wiki page	3183 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Kautz_graph
is Link from a Wikipage to another Wikipage of	De Bruijn graph MIPS architecture processors Kautz SiCortex
is Wikipage disambiguates of	Kautz
is foaf:primaryTopic of	wikipedia-en:Kautz_graph

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software