Results 21 to 30 of about 26,712 (151)
Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs [PDF]
Graphs and Combinatorics, 2018 15 ...
Aras Erzurumluoglu +2 more
openaire +3 more sources
ZERO FORCING NUMBER AND MAXIMUM NULLITY OF GENERAL POWER GRAPHS [PDF]
Journal of Algebraic SystemsLet Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ.
Fateme Kheiridosst, Ebrahim Vatandoost
doaj +1 more source
The failed zero forcing number of a graph [PDF]
Involve, a Journal of Mathematics, 2015 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 color change rule results in all vertices joining S. The color change rule is: if a vertex v is in S, and exactly one neighbor u of v is not in S, then u joins S in the next iteration.
Fetcie, Katherine +2 more
openaire +2 more sources
A lower bound on the failed zero-forcing number of a graph
Involve, a Journal of Mathematics, 2023 11 pages, 13 figures.
Swanson, Nicolas, Ufferman, Eric
openaire +3 more sources
The Journal of Engineering, 2020 Comparison and analysis of the regularised zero forcing precoder, rapid numerical algorithms-based precoder and the truncated polynomial expansion-based precoder are done for massive multiple-input multiple-output wireless system for multicell scenario ...
Emmanuel Mukubwa, Oludare A. Sokoya
doaj +1 more source
Precoding and Beamforming Techniques in mmWave-Massive MIMO: Performance Assessment
IEEE Access, 2022 Massive MIMO and mmWave communication are the technologies for achieving 5G design goals. Fortunately, these two technologies share a symbiotic integration.
Tewelgn Kebede +4 more
doaj +1 more source
Line graphs: Their maximum nullities and zero forcing numbers [PDF]
Czechoslovak Mathematical Journal, 2016 The main aim of this paper is to analyze the maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing some specific properties. In [\textit{F. Barioli} et al., Linear Algebra Appl. 428, No.
Fallat, Shaun, Soltani, Abolghasem
openaire +2 more sources
PERFORMANCE ANALYSIS AND EVALUATION OF MASSIVE MIMO SYSTEM [PDF]
Applied Computer Science, 2020 This article examines the performance of massive MIMO uplink system over Rician fading channel. The performance is estimated regarding spectral efficiency versus number of base station antennas utilizing three plans of linear detection, maximum-ratio ...
Muaayed F. AL-RAWI +2 more
doaj +2 more sources
On the complexity of the positive semidefinite zero forcing number
Linear Algebra and its Applications, 2016 The positive zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring, and is related to a more conventional version of zero forcing. We establish a relation between the zero forcing and the fast-mixed searching, which implies some NP-completeness results for the zero forcing problem.
Meagher, Karen +2 more
openaire +3 more sources
Families of graphs with maximum nullity equal to zero forcing number
Special Matrices, 2018 The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number.
Alameda Joseph S. +7 more
doaj +1 more source