Search the repository

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: 1974; Downloads: 59
Full text (1,75 MB)
This document has more files! More...

On Almost Well-Covered Graphs of Girth at Least 6
Tinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2018, original scientific article

Keywords: maximal independent set, almost well-covered graph, independence gap, girth
Published in RUP: 06.12.2018; Views: 2902; Downloads: 64
Link to full text

Coding theory and applications, solved exercises and problems of linear codes
Enes Pašalić, 2013, other educational material

Keywords: Gilbert-Eliot channel model, linear code, linear block code, code design, undetected error probability, linear independence, standard form, codeword weight, code rate, systematic code, Binary Hamming code
Published in RUP: 15.10.2013; Views: 6129; Downloads: 98
Link to full text

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: 3961; Downloads: 131
Full text (300,57 KB)