Results 31 to 40 of about 113,121 (99)
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 ...
Bert L. Hartnell, Douglas F. Rall
openaire +2 more sources
British Journal of Management, EarlyView.Abstract Despite burgeoning attention to dark leaders, we lack understanding about how they shape their climates. Using the dark triad (Machiavellianism, narcissism, psychopathy), we integrate social psychology and leadership research on interpersonal, romantic and leader–follower relationships to identify two predominant influence strategies ...
Al‐Karim Samnani, Sadia Jahanzeb
wiley +1 more source
Sociology Lens, EarlyView.ABSTRACT This article examines how media usage trends of Roma people intersect with urban peripherality and structural inequalities. The study designed as a two‐stage comparative ethnographic field study and conducted in 2016 and 2025 on a Roma community living in Izmir Province of Türkiye, focuses on the ongoing deprivations of the Roma population in ...
Mehmet Işık, Şakir Eşitti
wiley +1 more source
, 2022 Let $\gamma(G)$ denote the domination number of graph $G$. Let $G$ and $H$ be graphs and $G\Box H$ their Cartesian product. For $h\in V(H)$ define $G_h=\{(g,h)\,|\,g\in V(G)\}$ and call this set a $G$-layer of $G\Box H$.
Špacapan, Simon
core
Weak Degeneracy of Planar Graphs
Journal of Graph Theory, Volume 113, Issue 3, Page 399-410, November 2026.ABSTRACT The weak degeneracy of a graph G is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d‐degenerate graph is weakly d‐degenerate, but the converse is not true in general (e.g., all connected d‐regular graphs except cycles and cliques
Anton Bernshteyn +2 more
wiley +1 more source
A note on Vizing's generalized conjecture [PDF]
, 2007 In this note we give a generalized version of Vizing's conjecture concerning the distance domination number for the cartesian product of two ...
Chellali, M., Blidia, M.
core
Behzad-Vizing conjecture and Cartesian product graphs
Electronic Notes in Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blaz Zmazek, Janez Zerovnik
openaire +4 more sources
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
MultiPsych, Volume 1, Issue 3, September 2026.ABSTRACT Purpose Teaching is widely recognised as a psychologically demanding profession, with sustained exposure to work‐related stressors posing risks to teachers' mental well‐being and professional functioning. Drawing on the ‘Job Demands‐Resources model and Self‐Determination Theory’, this study examined how teachers' psychological capital (PsyCap),
Sharon Abam Nortey +8 more
wiley +1 more source
Journal of Research on Adolescence, Volume 36, Issue 3, September 2026.Abstract The last decade has seen a surge in studies using Ecological Momentary Assessment (EMA), where participants complete brief daily questionnaires to capture real‐time experiences. While widely used to study adolescents' social–emotional processes, EMA that simultaneously assesses adolescents and their parents (i.e., dyadic and triadic designs ...
Reuma Gadassi‐Polack +2 more
wiley +1 more source