Results 41 to 50 of about 215 (116)
Scandinavian Journal of Psychology, Volume 67, Issue 2, Page 547-557, April 2026.ABSTRACT The relation between sleep and irritable affect has been studied extensively. However, whether this relation is bidirectional remains unclear. Furthermore, less is still known about associations between sleep and interpersonal behaviors and perceptions during social interactions. The current study examined bidirectional within‐person relations
Teus Mijnster +6 more
wiley +1 more source
Domination in the hierarchical product and Vizing’s conjecture
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, S. E. +2 more
openaire +2 more sources
A Class of Graphs Approaching Vizing\u27s Conjecture [PDF]
, 2016 For any graph G=(V,E), a subset S of V dominates G if all vertices are contained in the closed neighborhood of S, that is N[S]=V. The minimum cardinality over all such S is called the domination number, written γ(G). In 1963, V.G. Vizing conjectured that
Contractor, Aziz, Krop, Elliot
core +1 more source
Journal of the Association for Information Science and Technology, Volume 77, Issue 2, Page 367-382, February 2026.Abstract Chronic illness represents a transition for both patients and their family members although transitions and information behavior changes have largely been explored from an individual perspective. Illness‐related transitions may be undertaken individually or collectively, but little is known about how family information networks change in the ...
Lindsay K. Brown, Tiffany C. Veinot
wiley +1 more source
An improvement on Vizingʼs conjecture [PDF]
Information Processing Letters, 2013 Let $ (G)$ denote the domination number of a graph $G$. A {\it Roman domination function} of a graph $G$ is a function $f: V\to\{0,1,2\}$ such that every vertex with 0 has a neighbor with 2. The {\it Roman domination number} $ _R(G)$ is the minimum of $f(V(G))= _{v\in V}f(v)$ over all such functions.
openaire +2 more sources
Nearly Hamilton cycles in sublinear expanders and applications
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due to their potential for various applications to embedding problems in sparse graphs.
Shoham Letzter +2 more
wiley +1 more source
Vizing's conjecture and the one-half argument
Discussiones Mathematicae Graph Theory, 1995 Summary: The domination number of a graph \(G\) is the smallest order, \(\gamma (G)\), of a dominating set for \(G\). A conjecture of \textit{V. G. Vizing} [Vychisl. Sist. 9, 30-43 (1963; Zbl 0194.25203)] states that for every pair of graphs \(G\) and \(H\), \(\gamma (G \square H) \geq \gamma (G) \gamma (H)\), where \(G \square H\) denotes the ...
Hartnell, Bert, Rall, Douglas F.
openaire +1 more source
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
Electronic Journal of Graph Theory and Applications, 2022 Summary: Vizing conjectured that \(\chi^\prime_\ell(G) \leq \Delta + 1\) for all graphs. For a graph \(G\) and nonnegative integer \(k\), we say \(G\) is a \(k\)-list-edge-critical graph if \(\chi^\prime_\ell (G)>k\), but \(\chi^\prime_\ell(G-e)\leq k\) for all \(e \in E(G)\).
Joshua Harrelson, Hannah Reavis
openaire +1 more source
Journal of Clinical Psychology, Volume 81, Issue 11, Page 1095-1102, November 2025.ABSTRACT Recent research has called into question the robustness and reliability of using body movements to activate motivational systems like approach‐reward. The purpose of the current studies was to test the effect of a repeated flexion movement task on approach‐reward system activation, positive and negative affect, and persistence on a difficult ...
Marissa R. Vander Missen +8 more
wiley +1 more source
A result on Vizing's conjecture
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source