Results 21 to 30 of about 28,893 (164)

Computing the Energy and Estrada Index of Different Molecular Structures

Journal of Chemistry, 2022
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, Rukhshanda Anjum, Qin Xin, Fairouz Tchier, Iram Anwar-ul-Haq, Yaé Ulrich Gaba   +5 more
doaj   +1 more source

Graph Compression for Adjacency-Matrix Multiplication

SN Computer Science, 2022
AbstractComputing 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 computation-friendly, in the sense that they
Alexandre P. Francisco, Travis Gagie, Dominik Köppl, Susana Ladra, Gonzalo Navarro   +4 more
openaire   +2 more sources

aMatReader: Importing adjacency matrices via Cytoscape Automation [version 1; referees: 2 approved]

F1000Research, 2018
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, David Otasek, John H Morris, Barry Demchak   +3 more
doaj   +1 more source

Incidence matrices and line graphs of mixed graphs

Special Matrices, 2023
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, Alomari Omar, Sander Torsten   +2 more
doaj   +1 more source

The General Extended Adjacency Eigenvalues of Chain Graphs

Mathematics
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, Hilal A. Ganie, Kinkar Chandra Das, Yilun Shang   +3 more
doaj   +1 more source

aMatReader: Importing adjacency matrices via Cytoscape Automation [version 2; referees: 2 approved]

F1000Research, 2018
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, David Otasek, John H Morris, Barry Demchak   +3 more
doaj   +1 more source

On α-adjacency energy of graphs and Zagreb index

AKCE International Journal of Graphs and Combinatorics, 2021
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, Bilal A. Rather, Hilal A. Ganie, Rezwan ul Shaban   +3 more
doaj   +1 more source

Multivariate Fence: Using Parallel Coordinates to Locate and Compare Attributes of Adjacency Matrix Nodes in Immersive Environment

Applied Sciences, 2022
Adjacency matrix visualization is a common method for presenting graph data, and the Focus+Context technique can be used to explore the details of the ROI (region of interest).
Tiemeng Li, Yanning Jin, Songqian Wu, Shiran Liu   +3 more
doaj   +1 more source

Adjacency Matrix of a Semigraph

Electronic Notes in Discrete Mathematics, 2017
Abstract Semigraph was defined by Sampathkumar as a generalization of a graph. In this paper the adjacency matrix which represents semigraph uniquely and a characterization of such a matrix is obtained. An algorithm to construct the semigraph from a given square matrix, if semigraphical is given.
Y.S. Gaidhani, C.M. Deshpande, B.P. Athawale   +2 more
openaire   +1 more source

On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs

Journal of Mathematics, 2016
Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj   +1 more source