Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


Iskanje brez iskalnega niza vrača največ 100 zadetkov!

11 - 20 / 100
Na začetekNa prejšnjo stran12345678910Na naslednjo stranNa konec
11.
Uniform equations for bipartite graphs and the center of a Terwilliger algebra
Štefko Miklavič, Giusy Monzillo, 2026, izvirni znanstveni članek

Opis: The uniform property was introduced by P. Terwilliger in the context of graded posets and was later extended to connected bipartite graphs. The core of this definition involves the so called uniform equations that must be satisfied. Let Γ denote a connected bipartite graph. Fix a vertex x of Γand let T=T(x) denote the corresponding Terwilliger algebra. In this paper, we study the connections between the uniform equations and the center of T. We show that these uniform equations give rise to a certain subspace of the center of T. Changing the logical direction, we show that if a matrix of a particular form belongs to the center of T, then uniform equations are satisfified.
Ključne besede: uniform equations, center of a Terwilliger algebra, bipartite graphs
Objavljeno v RUP: 08.05.2026; Ogledov: 69; Prenosov: 7
.pdf Celotno besedilo (966,73 KB)
Gradivo ima več datotek! Več...

12.
Motivi za pohodništvo v Sloveniji : zaključni projekt
Polona Erjavec, 2026, diplomsko delo

Ključne besede: pohodništvo, motivacija, notranji in zunanji motivi, aktivnost
Objavljeno v RUP: 07.05.2026; Ogledov: 113; Prenosov: 9
.pdf Celotno besedilo (1,34 MB)

13.
14.
15.
16.
17.
18.
Group distance magic cubic graphs
Sylwia Cichacz, Štefko Miklavič, 2026, izvirni znanstveni članek

Opis: A $\Gamma$-distance magic labeling of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $\mu$. In this case, the element $\mu$ is called the magic constant of $G$. A graph $G$ is called a group distance magic if there exists a $\Gamma$-distance magic labeling of $G$ for every Abelian group $\Gamma$ of order $n$. In this paper, we focused on cubic $\Gamma$-distance magic graphs as well as some properties of such graphs.
Ključne besede: group distance magic labeling, Kotzig array, generalized Petersen graph
Objavljeno v RUP: 06.05.2026; Ogledov: 109; Prenosov: 5
.pdf Celotno besedilo (187,65 KB)
Gradivo ima več datotek! Več...

19.
20.
Iskanje izvedeno v 0.64 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici