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


31 - 35 / 35
Na začetekNa prejšnjo stran1234Na naslednjo stranNa konec
31.
32.
On the recognition of k-equistable graphs
Vadim E. Levit, Martin Milanič, D. Tankus, 2012, objavljeni znanstveni prispevek na konferenci

Ključne besede: maximal stable set, equistable graph, polynomial time algorithm
Objavljeno v RUP: 15.10.2013; Ogledov: 2830; Prenosov: 129
URL Povezava na celotno besedilo

33.
Identities with generalized skew derivations on Lie ideals
Vincenzo De Filippis, Ajda Fošner, Feng Wei, 2013, izvirni znanstveni članek

Opis: Let ▫$m, n$▫ be two nonzero fixed positive integers, ▫$R$▫ a 2-torsion free prime ring with the right Martindale quotient ring ▫$Q$▫, ▫$L$▫ a non-central Lie ideal of ▫$R$▫, and ▫$\delta$▫ a derivation of ▫$R$▫. Suppose that ▫$\alpha$▫ is an automorphism of ▫$R$▫, ▫$D$▫ a skew derivation of ▫$R$▫ with the associated automorphism ▫$\alpha$▫, and ▫$F$▫ a generalized skew derivation of ▫$R$▫ with the associated skew derivation ▫$D$▫. If ▫$$F(x^{m+n}) = F(x^m)x^n + x^m \delta (x^n)$$▫ is a polynomial identity for ▫$L$▫, then either ▫$R$▫ satisfies the standard polynomial identity ▫$s_4(x_1, x_2, x_3, x_4)$▫ of degree 4, or ▫$F$▫ is a generalized derivation of ▫$R$▫ and ▫$\delta = D$▫. Furthermore, in the latter case one of the following statements holds: (1) ▫$D = \delta = 0$▫ and there exists ▫$a \in Q$▫ such that ▫$F(x) = ax$▫ for all ▫$x \in R$▫; (2) ▫$\alpha$▫ is the identical mapping of ▫$R$▫.
Ključne besede: mathematics, algebra, polynomial identity, generalized skew derivation, prime ring
Objavljeno v RUP: 15.10.2013; Ogledov: 4161; Prenosov: 144
URL Povezava na celotno besedilo

34.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, prispevek na konferenci brez natisa

Ključne besede: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Objavljeno v RUP: 15.10.2013; Ogledov: 3122; Prenosov: 67
URL Povezava na celotno besedilo

35.
On bipartite Q-polynomial distance-regular graphs with c [sub] 2 [equal] 1
Štefko Miklavič, 2007, izvirni znanstveni članek

Opis: Let ▫$\Gamma$▫ denote a bipartite ▫$Q$▫-polynomial distance-regular graph with diameter ▫$d \ge 3$▫, valency ▫$k \ge 3$▫ and intersection number ▫$c_2=1$▫. We show that ▫$\Gamma$▫ has a certain equitable partition of its vertex set which involves ▫$4d-4$▫ cells. We use this partition to show that the intersection numbers of ▫$\Gamma$▫ satisfy the following divisibility conditions: (I) ▫$c_{i+1}-1$▫ divides ▫$c_i(c_i-1)$▫ for ▫$2 \le i \le d-1$▫, and (II) ▫$b_{i-1}-1$▫ divides ▫$b_i(b_i-1)$▫ for ▫$1 \le i \le d-1$▫. Using these divisibility conditions we show that ▫$\Gamma$▫ does not exist if ▫$d=4$▫.
Ključne besede: mathematics, grah theory, distance-regular graphs, ▫$Q$▫-polynomial property, equitable partitions
Objavljeno v RUP: 15.10.2013; Ogledov: 4048; Prenosov: 37
URL Povezava na celotno besedilo

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