Results 31 to 40 of about 1,619,561 (291)
On the Inverse of Forward Adjacency Matrix
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the conventional incidence matrix, but in a slightly different manner. This matrix has only 0, 1 or -1 as its elements.
Pritam Mukherjee, L. Satish
openaire +3 more sources
Schema of the adjacency matrix.
The elements of the adjacency matrix are the weights of links. Each row of the adjacency matrix contains the weights of in-links for the corresponding node, and the number of nonzero entries is its in-degree. Similarly, each column carries the weights of
Ilias Rentzeperis (10215602) +2 more
core +1 more source
Adjacency Matrix of Real-World (nine cities)
This readme.txt file was generated on 2021-02-06 by Mohsen Ghaffari and Dr. Mansoor Davoodi-Monfared. GENERAL INFORMATION Adjacency Matrix of Real-World (Nine cities) Principal Investigator Contact Information Mohsen Ghaffari Department of ...
Ghaffari, M (via Mendeley Data)
core +1 more source
The General Extended Adjacency Eigenvalues of Chain Graphs
In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended ...
Bilal Ahmad Rather +3 more
doaj +1 more source
Computing the Energy and Estrada Index of Different Molecular Structures
Graph energy is an invariant that is derived from the spectrum of the adjacency matrix of a graph. Graph energy is actually the absolute sum of all the eigenvalues of the adjacency matrix of a graph i.e.
Zeeshan Saleem Mufti +5 more
doaj +1 more source
aMatReader: Importing adjacency matrices via Cytoscape Automation [version 1; referees: 2 approved]
Adjacency matrices are useful for storing pairwise interaction data, such as correlations between gene pairs in a pathway or similarities between genes and conditions. The aMatReader app enables users to import one or multiple adjacency matrix files into
Brett Settle +3 more
doaj +1 more source
Incidence matrices and line graphs of mixed graphs
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source
aMatReader: Importing adjacency matrices via Cytoscape Automation [version 2; referees: 2 approved]
Adjacency matrices are useful for storing pairwise interaction data, such as correlations between gene pairs in a pathway or similarities between genes and conditions. The aMatReader app enables users to import one or multiple adjacency matrix files into
Brett Settle +3 more
doaj +1 more source
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs [PDF]
AbstractThe article gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from x to y is equal to the complex unity i (and its symmetric entry is ) if the reverse arc is not present.
Krystal Guo, Bojan Mohar
openaire +2 more sources
On α-adjacency energy of graphs and Zagreb index
Let A(G) be the adjacency matrix and D(G) be the diagonal matrix of the vertex degrees of a simple connected graph G. Nikiforov defined the matrix of the convex combinations of D(G) and A(G) as for If are the eigenvalues of (which we call α-adjacency ...
S. Pirzada +3 more
doaj +1 more source

