Maximal Ladder Graphs.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F03%3A00000012" target="_blank" >RIV/46747885:24510/03:00000012 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Maximal Ladder Graphs.
Original language description
Paper deals with ladder graphs that can be used as graph model of the binary fully redundant number system. The number system plays an important role in applications. The ladder graphs with maximum number of paths are found.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Prezentace matematiky
ISBN
80-7083-739-X
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
49-54
Publisher name
TU Liberec
Place of publication
Liberec
Event location
Liberec
Event date
Sep 9, 2003
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—