Results 11 to 20 of about 448,626 (277)
The Zero Forcing Number of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2019 A subset S of initially infected vertices of a graph G is called zero forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbor, infects this neighbor. The zero forcing number of G is the minimum cardinality of a zero forcing set in G.
Kalinowski, Thomas +2 more
openaire +5 more sources
Positive semidefinite zero forcing
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ekstrand, Jason +13 more
openaire +5 more sources
Fuzzy Forcing Set on Fuzzy Graphs [PDF]
Journal of Mahani Mathematical Research, 2019 The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time
Layia Aliahmadipour, Saeedeh Rashidi
doaj +1 more source
Topology and its Applications, 2023 Considering any dense subsemigroup of the additive semigroup of positive real numbers and a filter associated with it as the domain of thought, various concepts of sets like sets that forces recurrence near zero, sets that contains broken IP-set near near zero, sets that forces uniform recurrence near zero and sets that contains broken syndetic set ...
Manoranjan Singha, Ujjal Kumar Hom
openaire +3 more sources
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Signed zero forcing number and controllability for a networks system with a directed hypercube [PDF]
MATEC Web of Conferences, 2022 The controllability for complex network system is to find the minimum number of leaders for the network system to achieve effective control of the global networks.
Mou Gufang, Zhang Qiuyan
doaj +1 more source
Improved Signal Detection Techniques for QOSTBC System in Fast Fading Channel
Journal of Telecommunications and Information Technology, 2020 Most existing quasi-orthogonal space time block coding (QO-STBC) schemes have been developed relying on the assumption that the channel is flat or remains static during the length of the code word symbol periods to achieve an optimal antenna diversity ...
Jyoti Prasanna Patra, Poonam Singh
doaj +1 more source
IEEE Transactions on Wireless Communications, 2022 This paper considers a network of a multi-antenna array base station (BS) and a reconfigurable intelligent surface (RIS) to deliver both information to information users (IUs) and power to energy users (EUs). The RIS links the connection between the IUs and the BS as there is no direct path between the former and the latter.
Hongwen Yu +4 more
openaire +4 more sources
Throttling positive semidefinite zero forcing propagation time on graphs [PDF]
, 2018 Zero forcing is a process on a graph that colors vertices blue by starting with some of the vertices blue and applying a color change rule. Throttling minimizes the sum of the size of the initial blue vertex set and the number of the time steps needed to
Carlson, Joshua +7 more
core +4 more sources
Zero forcing in Benzenoid network
Proyecciones (Antofagasta), 2019 A set S of vertices in a graph G is called a dominating set of G if every vertex in V (G)\S is adjacent to some vertex in S. A set S is said to be a power dominating set of G if every vertex in the system is monitored by the set S following a set of rules for power system monitoring.
Anitha, J., Rajasingh, Indra
openaire +3 more sources