Results 21 to 30 of about 122,412 (281)
Graph Compression for Adjacency-Matrix Multiplication
Abstract Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper, we show that some well-known webgraph and social graph compression formats are
Alexandre P. Francisco +4 more
openaire +2 more sources
Social Network of Faculties According to Student Preferences in Transition to Higher Education
In social network analysis, the studies on weighted adjacency matrix of nodes are increasing day by day. In thispaper, a method is proposed by including node properties to neighbourhood matrix, in order to see the structures of weightedadjacency matrix ...
Güneş Mutlu, Ahmet Mete Çilingirtürk
doaj +1 more source
Theoretical study of energy, inertia and nullity of phenylene and anthracene
Energy of a molecule plays an important role in physics, chemistry and biology. In mathematics, the concept of energy is used in graph theory to help other subjects such as chemistry and physics.
Ahmad Zaheer +4 more
doaj +1 more source
On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]
This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab +2 more
doaj +1 more source
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 +2 more sources
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
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
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
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
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

