1. Iranian angle to nonaudit servicesMahdi Salehi, Mehdi Moradi, 2010, original scientific article Found in: ključnih besedah Summary of found: ...auditor, independence, nonaudit services, Iran, ... Keywords: auditor, independence, nonaudit services, Iran Published: 15.10.2013; Views: 1028; Downloads: 27 Full text (0,00 KB) This document has more files! More...

2. A note on domination and independencedomination numbers of graphsMartin 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 independencedomination 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 NPcomplete, 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$▫. Found in: ključnih besedah Summary of found: Zadetek v naslovu Keywords: Vizing's conjecture, domination number, independencedomination number, weakly chordal graph, NPcompleteness, hereditary graph class, IDDperfect graph Published: 15.10.2013; Views: 1477; Downloads: 77 Full text (0,00 KB) 
3. Board structure and corporate performanceÖzgür Arslan, Mehmet Baha Karan, Cihan Eksi, 2010, original scientific article Found in: ključnih besedah Summary of found: ...board size, boad independence, ROA, Tobin's Q, ... Keywords: board size, boad independence, ROA, Tobin's Q Published: 15.10.2013; Views: 839; Downloads: 49 Full text (0,00 KB) This document has more files! More...

4. Coding theory and applications, solved exercises and problems of linear codesEnes Pašalić, 2013, other educational material Found in: ključnih besedah Summary of found: ...code, code design, undetected error probability, linear independence, standard form, codeword weight, code rate, systematic... Keywords: GilbertEliot 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: 15.10.2013; Views: 3821; Downloads: 37 Full text (0,00 KB) This document has more files! More...

5. 
6. On Almost WellCovered Graphs of Girth at Least 6Didem Gozüpek, Tinaz Ekim, Ademir Hujdurović, Martin Milanič, 2018, original scientific article Found in: ključnih besedah Summary of found: ...maximal independent set, almost wellcovered graph, independence gap, girth... Keywords: maximal independent set, almost wellcovered graph, independence gap, girth Published: 06.12.2018; Views: 491; Downloads: 16 Full text (0,00 KB) 
7. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article Found in: ključnih besedah Summary of found: Zadetek v naslovu Keywords: maximal independent set, independent dominating set, wellcovered graph, hereditary independence gap, polynomialtime algorithm, NPhard problem Published: 19.05.2020; Views: 43; Downloads: 2 Full text (0,00 KB) 