Results 11 to 20 of about 88,866 (231)
Universal adjacency matrices with two eigenvalues
Linear Algebra and Its Applications, 2011 W. Haemers, G. Omidi
semanticscholar +3 more sources
Universal adjacency spectrum of zero divisor graph on the ring and its complement
AKCE International Journal of Graphs and Combinatorics, 2021 For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj +1 more source
Geo&Bio, 2023 The expediency of using the inverted Floyd–Warshall algorithm for a deeper study of factors of maximum influence on the occurrence and development of fires in the war zones of Donetsk and Lugansk oblasts is shown.
Olga Butenko, Anna Topchiy
doaj +1 more source
BinTree seeking: a novel approach to mine both bi-sparse and cohesive modules in protein interaction networks. [PDF]
PLoS ONE, 2011 Modern science of networks has brought significant advances to our understanding of complex systems biology. As a representative model of systems biology, Protein Interaction Networks (PINs) are characterized by a remarkable modular structures ...
Qing-Ju Jiao +3 more
doaj +1 more source
Universal Graph Compression: Stochastic Block Models [PDF]
IEEE Transactions on Information Theory, 2020 Motivated by the prevalent data science applications of processing large-scale graph data such as social networks and biological networks, this paper investigates lossless compression of data in the form of a labeled graph.
Alankrita Bhatt +3 more
semanticscholar +1 more source
Universal spectra of the disjoint union of regular graphs [PDF]
, 2020 A universal adjacency matrix of a graph $G$ with adjacency matrix $A$ is any matrix of the form $U = \alpha A + \beta I + \gamma J + \delta D$ with $\alpha \neq 0$, where $I$ is the identity matrix, $J$ is the all-ones matrix and $D$ is the diagonal ...
W. Haemers, M. Oboudi
semanticscholar +1 more source
Universal Graph Compression: Stochastic Block Models
International Symposium on Information Theory, 2021 Motivated by the prevalent data science applications of processing large-scale graph data such as social networks, web graphs, and biological networks, as well as the high I/O and communication costs of storing and transmitting such data, this paper ...
Alankrita Bhatt +3 more
semanticscholar +1 more source
Quantum edge correspondences and quantum Cuntz–Krieger algebras [PDF]
Journal of the London Mathematical Society, 2022 Given a quantum graph G=(B,ψ,A)${\mathcal {G}}=(B,\psi ,A)$ , we define a C*‐correspondence EG$E_{\mathcal {G}}$ over the non‐commutative vertex C*‐algebra B$B$ , called the quantum edge correspondence.
Michael Brannan +4 more
semanticscholar +1 more source
The Minimum Rank of Universal Adjacency Matrices [PDF]
, 2011 In this paper we introduce a new parameter for a graph called the minimum universal rank. This parameter is similar to the minimum rank of a graph. For a graph G the minimum universal rank of G is the minimum rank over all matrices of the form U ( α , β ,
Bahman Ahmadi +5 more
semanticscholar +1 more source
Universal computation by quantum walk. [PDF]
Physical Review Letters, 2008 In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a ...
Andrew M. Childs
semanticscholar +1 more source