Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 3
Izvirni znanstveni članek
Oznake: Cayley digraph;reachability relation;
In [A. Malnič, D. Marušič, N. Seifter, P. Šparl and B. Zgrablič, Reachability relations in digraphs, Europ. J. Combin. 29 (2008), 1566-1581] it was shown that properties of digraphs such as growth, property ▫$\mathbf{Z}$▫, and number of ends are reflected by the properties of certain reachability re ...
Leto: 2015 Vir: Repozitorij Univerze na Primorskem (RUP)
Izvirni znanstveni članek
Oznake: teorija grafov;usmerjeni grafi;rast;graph theory;digraph;reachability relations;end of a graph;property ▫$\mathbb{Z}$▫;growth;
In this paper we study reachability relations on vertices of digraphs, informally defined as follows. First, the weight of a walk is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed in the direction opposite to their orien ...
Leto: 2008 Vir: Pedagoška fakulteta (UL PEF)
Predgovor, spremna beseda
Oznake: matematika;teorija grafov;konferenca;mathematics;graph theory;conference;
Preface
Leto: 2003 Vir: Pedagoška fakulteta (UM PEF)
Št. zadetkov: 3
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: