Autor:	V. E. Tarakanov, F. M. Malyshev
Rok vydání:	1997
Předmět:	Discrete mathematics Modular decomposition Combinatorics Indifference graph Clique-sum Chordal graph General Mathematics Trapezoid graph BEST theorem Longest path problem Mathematics Metric dimension
Zdroj:	Mathematical Notes. 62:449-456
ISSN:	1573-8876 0001-4346
Popis:	Oriented graphs in which every pair of vertices can be connected by a unique path of given length (not depending on the choice of the pair of vertices) are studied. These graphs are a natural extension of the well-known de Bruijn graphs and retain their most important properties. Some results on the structure of and methods for constructing such graphs are obtained.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c261b08b919490269f90caf6a927e379 https://doi.org/10.1007/bf02358978 Zobrazit plný text záznamu Full text from SpringerLink