Failed Zero Forcing Numbers of Trees and Circulant Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$.
Luis Gomez +4 more
doaj +1 more source
Public Health Risk Evaluation through Mathematical Optimization in the Process of PPPs. [PDF]
Heydari M, Lai KK, Shi V, Xiao F.
europepmc +1 more source
Personal and joint liability of partner in limited liability company in UAE federal corporate law No. 32 of 2021. [PDF]
Kisswani N, Farah A.
europepmc +1 more source
Maximum Likelihood Estimation in Mixed Integer Linear Models. [PDF]
Tucker D, Zhao S, Potter LC.
europepmc +1 more source
Management of issues relating to marriage, mental illness, and Indian legislation. [PDF]
Vaishnav M, Sharma I.
europepmc +1 more source
Estrogenic/Progestin therapy and the development of Vestibular Schwannoma: A systematic review and meta-analysis. [PDF]
Amaral MVGCC, Bahmad F.
europepmc +1 more source
Improving the validity of neuroimaging decoding tests of invariant and configural neural representation. [PDF]
Soto FA, Narasiwodeyar S.
europepmc +1 more source
Accelerated enumeration of extreme rays through a positive-definite elementarity test. [PDF]
Mores W +3 more
europepmc +1 more source
Topological Engineering of Chiral Anomalies in Janus Nanoribbons. [PDF]
Saroka VA, Demin VA, Pizzochero M.
europepmc +1 more source

