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


1 - 9 / 9
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
User needs and perspectives on technologies or healthy ageing
Mateja Erce, Rok Ovsenik, Dean Lipovac, Michael David Burnard, 2021, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: older adults, building solutions, technology acceptance, well-being, independence
Objavljeno v RUP: 24.06.2021; Ogledov: 864; Prenosov: 48
.pdf Celotno besedilo (1,75 MB)
Gradivo ima več datotek! Več...

3.
4.
5.
6.
7.
Board structure and corporate performance
Özgür Arslan, Mehmet Baha Karan, Cihan Eksi, 2010, izvirni znanstveni članek

Ključne besede: board size, boad independence, ROA, Tobin's Q
Objavljeno v RUP: 15.10.2013; Ogledov: 2281; Prenosov: 83
URL Povezava na celotno besedilo

8.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, objavljeni znanstveni prispevek na konferenci

Opis: Vizing's conjecture is true for graphs ▫$G$▫ satisfying ▫$\gamma^i(G) = \gamma(G)$▫, where ▫$\gamma(G)$▫ is the domination number of a graph ▫$G$▫ and ▫$\gamma^i(G)$▫ is the independence-domination number of ▫$G$▫, that is, the maximum, over all independent sets ▫$I$▫ in ▫$G$▫, of the minimum number of vertices needed to dominate ▫$I$▫. The equality ▫$\gamma^i(G) = \gamma(G)$▫ is known to hold for all chordal graphs and for chordless cycles of length ▫$0 \pmod{3}$▫. We prove some results related to graphs for which the above equality holds. More specifically, we show that the problems of determining whether ▫$\gamma^i(G) = \gamma(G) = 2$▫ and of verifying whether ▫$\gamma^i(G) \ge 2$▫ are NP-complete, even if ▫$G$▫ is weakly chordal. We also initiate the study of the equality ▫$\gamma^i = \gamma$▫ in the context of hereditary graph classes and exhibit two infinite families of graphs for which ▫$\gamma^i < \gamma$▫.
Ključne besede: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Objavljeno v RUP: 15.10.2013; Ogledov: 2993; Prenosov: 128
.pdf Celotno besedilo (300,57 KB)

9.
Iranian angle to non-audit services
Mahdi Salehi, Mehdi Moradi, 2010, izvirni znanstveni članek

Ključne besede: auditor, independence, non-audit services, Iran
Objavljeno v RUP: 15.10.2013; Ogledov: 2370; Prenosov: 72
URL Povezava na celotno besedilo

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