Results 11 to 20 of about 270,111 (269)
Investigating Factors Affecting the Adoption of Virtual Fitting Room in Iranian Sportswear Stores: Application of CAT Theory [PDF]
Research in Sport Management and Marketing, 2023 Purpose: Trying on clothes in sportswear stores is a very time-consuming and tiring task. Virtual fitting rooms provides conditions where online consumers can try on the clothes they want before shopping.
Seyyed iman Ghaffarisadr +1 more
doaj +1 more source
The association of early maladaptive schemas and dysfunctional schema coping modes with interpersonal dominance and submissiveness: Perceived similarity in couples [PDF]
Klinik Psikoloji Dergisi, 2022 Schema Therapy Model and Interpersonal Theory of Personality have consistent developmental explanations of personality and interpersonal relationship patterns. According to the Schema Model, dysfunctional schema coping modes, as well as early maladaptive
Büşra Fatma Gültekin, Miray Akyunus
doaj +1 more source
DOMINATION AND EDGE DOMINATION IN TREES [PDF]
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\). The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). A set \(D \subseteq E\) is an edge dominating set if every edge in \(E\setminus D\)
B. Senthilkumar +2 more
openaire +4 more sources
Domination versus edge domination [PDF]
Discrete Applied Mathematics, 2020 We propose the conjecture that the domination number $γ(G)$ of a $Δ$-regular graph $G$ with $Δ\geq 1$ is always at most its edge domination number $γ_e(G)$, which coincides with the domination number of its line graph. We prove that $γ(G)\leq \left(1+\frac{2(Δ-1)}{Δ2^Δ}\right)γ_e(G)$ for general $Δ\geq 1$, and $γ(G)\leq \left(\frac{7}{6}-\frac{1}{204 ...
Julien Baste +4 more
openaire +2 more sources
Examining the Relationship Between the Dominant Eye and the Dominant Hand [PDF]
Function and Disability Journal, 2023 Background and Objectives: This study aims to determine the relationship between hand dominance and ocular dominance (OD) using different test formats of handedness and ocular dominance.
Mohammad Almasi +3 more
doaj
Identification of Allele-Specific Expression Genes Associated with Maize Heterosis
Agronomy, 2023 Deciphering the molecular basis of heterosis would yield genes and markers for designing improved maize-hybrid varieties. In this study, 481 BC1F3 lines derived from Zheng58 and PH4CV were genotyped with 15,386 polymorphic SNPs markers and testcrossed ...
Yuting Ma +5 more
doaj +1 more source
Multi-Domain Concept of Using A2/AD Capabilities in the Military Strategy of the Russian Federation
Polish Political Science Yearbook, 2023 This article presents the results of research, which set out to clarify the importance and role played by the concept of using A2/AD capabilities in the military strategy of the Russian Federation.
Mirosław Banasik
doaj +1 more source
Dominating Sets and Domination Polynomials of Paths [PDF]
International Journal of Mathematics and Mathematical Sciences, 2009 Let G = (V, E) be a simple graph. A set S⊆V is a dominating set of G, if every vertex in V\S is adjacent to at least one vertex in S. Let be the family of all dominating sets of a path Pn with cardinality i, and let . In this paper, we construct , and obtain a recursive formula for d(Pn, i).
Saeid Alikhani, Yee-Hock Peng
openaire +2 more sources
Domination and Fractional Domination in Digraphs
The Electronic Journal of Combinatorics, 2018 In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ on $n$ vertices has fractional domination number at most $2\alpha(G)$ and domination number at most $2\alpha(G) \cdot \log{n}$.
Harutyunyan, Ararat +3 more
openaire +5 more sources
The Electronic Journal of Combinatorics, 2012 In this paper, we propose a new network reliability measure for some particular kind of service networks, which we refer to as domination reliability. We relate this new reliability measure to the domination polynomial of a graph and the coverage probability of a hypergraph.
Klaus Dohmen, Peter Tittmann 0001
openaire +3 more sources