Results 191 to 200 of about 88,866 (231)

An empirical network study of the antimalarial supply chain in Ghana. [PDF]

PLoS One
Adams O, Wang CL, Chattoe-Brown E, Hamill H, Hampshire K, Mariwah S, Amoako-Sakyi D, Johnson FA, Ackland GJ.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Perfect codes and universal adjacency spectra of commuting graphs of finite groups

Journal of Algebra and its Applications, 2022
The commuting graph [Formula: see text] of a finite group [Formula: see text] has vertex set as [Formula: see text], and any two distinct vertices [Formula: see text] are adjacent if [Formula: see text] and [Formula: see text] commute with each other. In
Subarsha Banerjee
semanticscholar   +1 more source

On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs

Linear and multilinear algebra, 2019
The universal adjacency matrix U of a graph Γ, with adjacency matrix A, is a linear combination of A, the diagonal matrix D of vertex degrees, the identity matrix I, and the all-1 matrix J with real coefficients, that is, , with and . Thus, in particular
C. Dalf'o, M. Fiol, S. Pavl'ikov'a, J. Širáň   +3 more
semanticscholar   +1 more source

Unitary coined discrete-time quantum walks on directed multigraphs

Quantum Information Processing, 2023
Unitary coined discrete-time quantum walks (UCDTQW) constitute a universal model of computation, meaning that any computation done by a general purpose quantum computer can either be done using the UCDTQW framework.
Allan Wing-Bocanegra, S. Venegas-Andraca
semanticscholar   +1 more source

Universal adjacency spectrum of the cozero-divisor graph and its complement on a finite commutative ring with unity

Discret. Math. Algorithms Appl.
For a finite simple undirected graph [Formula: see text], the universal adjacency matrix [Formula: see text] is a linear combination of the adjacency matrix [Formula: see text], the degree diagonal matrix [Formula: see text], the identity matrix [Formula:
Saraswati Bajaj, P. Panigrahi
semanticscholar   +1 more source

Hamiltonians of Bipartite Walks

Electronic Journal of Combinatorics, 2022
In this paper, we introduce a discrete quantum walk model called bipartite walks. Bipartite walks include many known discrete quantum walk models, like Grover’s walks, vertex-face walks.
Qiuting Chen, C. Godsil, Mariia Sobchuk, Harmony Zhan   +3 more
semanticscholar   +1 more source

Unitary coin discrete-time quantum walk on complete graph K4 based on adjacency matrix decomposition

Modern Physics Letters A
The Unitary Coin Discrete-Time Quantum Walk (UCDTQW) serves as a universal model for quantum computers. In this paper, we conduct matrix analysis based on the unitary operator of UCDTQW, constructing the system’s shift operator as the unitary form of the
Qi Han, Rong Zhang, Shijiao Xing, Jingyi Zhang, Ziyi Ma   +4 more
semanticscholar   +1 more source

Spatial Autocorrelation Analysis of Infectious Disease Incidence Rates at State and District Level Using Supra-Adjacency Weights Matrix

Universal Journal of Public Health
The spatiotemporal correlation in disease incidence rates resulting from the spatial arrangement of neighboring geographical units is often conceptualized through constructing contiguity-based spatial weights.
Piau Phang, Saira Aslam, Jane Labadin, V. J. Jayaraj   +3 more
semanticscholar   +1 more source