Print
Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 9 / 9
First pagePrevious page1Next pageLast page
1.
2.
User needs and perspectives on technologies or healthy ageing
Mateja Erce, Rok Ovsenik, Dean Lipovac, Michael David Burnard, 2021, published scientific conference contribution abstract

Keywords: older adults, building solutions, technology acceptance, well-being, independence
Published in RUP: 24.06.2021; Views: 862; Downloads: 48
.pdf Full text (1,75 MB)
This document has more files! More...

3.
4.
5.
6.
7.
Board structure and corporate performance
Özgür Arslan, Mehmet Baha Karan, Cihan Eksi, 2010, original scientific article

Keywords: board size, boad independence, ROA, Tobin's Q
Published in RUP: 15.10.2013; Views: 2278; Downloads: 83
URL Link to full text

8.
A note on domination and independence-domination numbers of graphs
Martin Milanič, 2013, published scientific conference contribution

Abstract: 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$▫.
Keywords: Vizing's conjecture, domination number, independence-domination number, weakly chordal graph, NP-completeness, hereditary graph class, IDD-perfect graph
Published in RUP: 15.10.2013; Views: 2987; Downloads: 128
.pdf Full text (300,57 KB)

9.
Iranian angle to non-audit services
Mahdi Salehi, Mehdi Moradi, 2010, original scientific article

Keywords: auditor, independence, non-audit services, Iran
Published in RUP: 15.10.2013; Views: 2368; Downloads: 72
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica