Results 71 to 80 of about 23,593 (263)
Some results on minimum skew zero forcing sets, and skew zero forcing number
, 2014 Let $G$ be a graph, and $Z$ a subset of its vertices, which we color black, while the remaining are colored white. We define the skew color change rule as follows: if $u$ is a vertex of $G$, and exactly one of its neighbors $v$, is white, then change the color of $v$ to black.
openaire +2 more sources
Zero Forcing sets and Power Dominating sets of cardinality at most 2
, 2019 Let $S$ be a set of vertices of a graph $G$. Let $cl(S)$ be the set of vertices built from $S$, by iteratively applying the following propagation rule: if a vertex and all but exactly one of its neighbors are in $cl(S)$, then the remaining neighbor is also in $cl(S)$. A set $S$ is called a zero forcing set of $G$ if $cl(S)=V(G)$.
Shahbaznejad, Najibeh +2 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.A simplified thermoplastic pultrusion model is developed to predict thermal fields in glass fiber/polyethylene terephthalate (GF/PET) composites with reduced computational cost. By combining effective material homogenization, validation against literature data, and Gaussian‐process‐based optimization, the study reveals how heating limits, pulling speed,
Elder Soares +3 more
wiley +1 more source
Chiral active matter: microscopic ‘torque dipoles’ have more than one hydrodynamic description
New Journal of Physics, 2019 Many biological systems, such as bacterial suspensions and actomyosin networks, form polar liquid crystals. These systems are ‘active’ or far-from-equilibrium, due to local forcing of the solvent by the constituent particles.
Tomer Markovich +2 more
doaj +1 more source
2-distance Zero Forcing Sets in Graphs
European Journal of Pure and Applied MathematicsIn this paper, we introduce new concept in graph theory called 2-distance zero forcing. We give some properties of this new parameter and investigate its connections with other parameters such as zero forcing and hop domination. We show that 2-distance zero forcing and hop domination (respectively, zero forcing parameter) are incomparable. Moreover, we
Javier Hassan +2 more
openaire +1 more source
Using variants of zero forcing to bound the inertia set of a graph
The Electronic Journal of Linear Algebra, 2015 Zero forcing is a combinatorial game played on a graph with a goal of changing the color of every vertex at minimal cost. This leads to a parameter known as the zero forcing number that can be used to give an upper bound for the maximum nullity of a matrix associated with the graph. A variation on the zero forcing game is introduced that can be used to
Steve Butler, Jason Grout, H. Hall
openaire +1 more source
, 2022 An $X$-TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property $X$, with an edge between two sets if one is obtained from the other by adding or removing one element. This paper considers the $X$-TAR graph for $X-$ sets of vertices of a base graph $G$ where the $X$-sets of $G$ must satisfy certain ...
Bong, Novi H. +4 more
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Phase‐field simulations coupled with dislocation‐density‐based crystal plasticity modeling reproduce γ′ rafting behavior in single‐crystal Ni‐based superalloys under varied loading conditions. The model captures both macroscopic creep and microscopic morphology evolution, with results matching high‐temperature creep experiments.
Micheal Younan +5 more
wiley +1 more source
Failed zero forcing and critical sets on directed graphs
, 2019 Let $D$ be a simple digraph (directed graph) with vertex set $V(D)$ and arc set $A(D)$ where $n=|V(D)|$, and each arc is an ordered pair of distinct vertices. If $(v,u) \in A(D)$, then $u$ is considered an \emph{out-neighbor} of $v$ in $D$. Initially, we designate each vertex to be either filled or empty.
Adams, Alyssa, Jacob, Bonnie
openaire +3 more sources