Results 41 to 50 of about 5,825,526 (293)

Zero forcing parameters and minimum rank problems [PDF]

, 2010
The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by G.
Holst, van der, H., Fallat, S.M., Hall, H. Tracy, Hogben, L., Hogben, L, Driessche, P van den, Shader, BL, Shader, Bryan, Barrett, W., Barrett, Wayne, van den Driessche, P., Barioli, F, Hall, H.T., Shader, B.L., Fallat, Shaun, Hogben, Leslie, Barrett, W, Barioli, F., Driessche, van den, P., Fallat, Shaun M., Barioli, Francesco, Holst, H Hein van der, van der Holst, Hein, Hall, HT, Fallat, SM   +24 more
core   +1 more source

SH-graph automata with applications [PDF]

Journal of Mahani Mathematical Research
In this paper, because semihoops are the most basic residuated structure that contain all logical algebras based on Galois connections, therefore we introduce a new type fuzzy graph and its complement based on semihoops, denoted by $SH$-graph $G$ and $G^\
TianYu Zhang, Xiao Long Xin, Mohammad Mehdi Zahedi   +2 more
doaj   +1 more source

Zero forcing sets and bipartite circulants

Linear Algebra and its Applications, 2012
22 pages, 13 ...
openaire   +3 more sources

On minimum rank and zero forcing sets of a graph

Linear Algebra and its Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, Liang-Hao, Chang, Gerard J., Yeh, Hong-Gwa   +2 more
openaire   +3 more sources

Zero Forcing Sets for Graphs

, 2013
A Thesis submitted to the Faculty of Graduate Studies and Research in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Mathematics, University of Regina. x, 132 p.
openaire   +4 more sources

Recognizable Languages of k-Forcing Automata

Mathematical and Computational Applications
In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs.
Marzieh Shamsizadeh, Mohammad Mehdi Zahedi, Khadijeh Abolpour, Manuel De la Sen   +3 more
doaj   +1 more source

Zero forcing sets and the minimum rank of graphs

Linear Algebra and its Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barioli, Francesco, Barrett, Wayne, Butler, Steve, Cioabă, Sebastian, Cvetković, Dragoš, Fallat, Shaun, Godsil, Chris, Haemers, Willem, Hogben, Leslie, Mikkelson, Rana, Narayan, Sivaram, Pryporova, Olga, Sciriha, Irene, So, Wasin, Stevanović, Dragan, van der Holst, Hein, Vander Meulen, Kevin, Wangsness Wehe, Amy   +17 more
openaire   +4 more sources

Calpain small subunit homodimerization is robust and calcium‐independent

FEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy, Trina Dykstra‐MacPherson, Mathias A. Bell, Peter L. Davies, Ruby May A. Sullan   +4 more
wiley   +1 more source

Propagation time for probabilistic zero forcing [PDF]

, 2018
Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing
Hogben, Leslie, Geneson, Jesse
core  

DropNet: An Improved Dropping Algorithm Based on Neural Networks for Line-of-Sight Massive MIMO

IEEE Access, 2021
In line-of-sight massive MIMO, the downlink channel vectors of few users may become highly correlated. This high correlation limits the sum-rates of systems employing linear precoders.
Amirashkan Farsaei, Alireza Sheikh, Ulf Gustavsson, Alex Alvarado, Frans M. J. Willems   +4 more
doaj   +1 more source