Enumerace počtů vrcholů almost Mooreovských orientovaných grafů se selfrepeat vrcholy

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F08%3A00501447" target="_blank" >RIV/49777513:23520/08:00501447 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

Popis výsledku v původním jazyce

An almost Moore digraph G of degree d >1, diameter k>1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u there exists a vertex v, called repeat of u and denoted by r(u) = v, such that there are two walks of length at most k from u to v. The smallest positive integer p such that the composition rp(u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almostMoore digraph of diameter k greater or equal to 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex.

Název v anglickém jazyce

Enumerations of vertex orders of almost Moore digraphs with selfrepeats

Popis výsledku anglicky

An almost Moore digraph G of degree d >1, diameter k>1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u there exists a vertex v, called repeat of u and denoted by r(u) = v, such that there are two walks of length at most k from u to v. The smallest positive integer p such that the composition rp(u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almostMoore digraph of diameter k greater or equal to 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2008

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Discrete Mathematics

ISSN

0012-365X

e-ISSN

—

Svazek periodika

308

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

6

Strana od-do

—

Kód UT WoS článku

000251879500010

EID výsledku v databázi Scopus

—