Temat: directed graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Domination hypergraphs of certain digraphs
Autorzy:: Sonntag, M.
Teichert, H. M.
Powiązania:: https://bibliotekanauki.pl/articles/254767.pdf
Data publikacji:: 2010
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: hypergraph
dominating set
directed graph
Opis:: If D = (V,A) is a digraph, its domination hypergraph DH(D) = (V, E) has the vertex set V and e ⊆ V is an edge of DH(D) if and only if e is a minimal dominating set of D. We investigate domination hypergraphs of special classes of digraphs, namely tournaments, paths and cycles. Finally, using a special decomposition/composition method we construct edge sets of domination hypergraphs of certain digraphs.
Źródło:: Opuscula Mathematica; 2010, 30, 2; 179-191
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The minimum exponent of the primitive digraphs on the given number of arcs
Autorzy:: Rosiak, J.
Powiązania:: https://bibliotekanauki.pl/articles/2050786.pdf
Data publikacji:: 2004
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: primitive directed graph
exponent
Frobenius number
Opis:: Primitive digraphs on n vertices, k arcs and girth s are considered. By a(n, k, s) we mean the minimum exponent taken over all such digraphs. We estimate the number a(n, k, s) using the Frobenius number for special values of k and s.
Źródło:: Opuscula Mathematica; 2004, 24, 2; 197-202
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Non-factorizable c-valued functions induced by finite connected graphs
Autorzy:: Cho, I.
Powiązania:: https://bibliotekanauki.pl/articles/255928.pdf
Data publikacji:: 2017
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: directed graphs
graph groupoids
Redei zeta functions
graph zeta functions
non-factorizable graphs
gluing on graphs
Opis:: In this paper, we study factorizability of C-valued formal series at fixed vertices, called the graph zeta functions, induced by the reduced length on the graph groupoids of given finite connected directed graphs. The construction of such functions is motivated by that of Redei zeta functions. In particular, we are interested in (i) “non-factorizability” of such functions, and (ii) certain factorizable functions induced by non-factorizable functions. By constructing factorizable functions from our non-factorizable functions, we study relations between graph zeta functions and well-known number-theoretic objects, the Riemann zeta function and the Euler totient function.
Źródło:: Opuscula Mathematica; 2017, 37, 2; 225-263
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Free probability induced by electric resistance networks on energy Hilbert spaces
Autorzy:: Cho, I.
Jorgensen, P. E. T.
Powiązania:: https://bibliotekanauki.pl/articles/254830.pdf
Data publikacji:: 2011
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: directed graphs
graph groupoids
electric resistance networks
ERN-groupoids
energy Hilbert spaces
ERN-algebras
free moments
free cumulants
Opis:: We show that a class of countable weighted graphs arising in the study of electric resistance networks (ERNs) are naturally associated with groupoids. Starting with a fixed ERN, it is known that there is a canonical energy form and a derived energy Hilbert space Hε. From Hε, one then studies resistance metrics and boundaries of the ERNs. But in earlier research, there does not appear to be a natural algebra of bounded operators acting on Hε. With the use of our ERN-groupoid, we show that Hε may be derived as a representation Hilbert space of a universal representation of a groupoid algebra [formula], and we display other representations. Among our applications, we identify a free structure of [formula] in terms of the energy form.
Źródło:: Opuscula Mathematica; 2011, 31, 4; 549-598
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja