Results 291 to 300 of about 113,956 (308)

A Compact Form of the Adjacency Matrix

Journal of Chemical Information and Computer Sciences, 2000
It has been shown that the adjacency matrix can be transformed into a row vector and then into a single number. This number can again be decoded to recover the row vector, and this in turn can be decoded to restore the original adjacency matrix. A special, rather efficient coding scheme was devised for acyclic structures.
openaire   +2 more sources

On the eigenvalue and energy of extended adjacency matrix

Applied Mathematics and Computation, 2021
Abstract The extended adjacency matrix of graph G , A e x is a symmetric real matrix that if i ≠ j and u i u j ∈ E ( G ) , then the i j th entry is d u i 2 + d u j 2 / 2 d u i d u j , and zero otherwise, where d u indicates the degree
Modjtaba Ghorbani, Samaneh Zangi, Xueliang Li, Najaf Amraei   +3 more
openaire   +2 more sources

An algorithm for planarity testing by adjacency matrix

2012 International Conference on Machine Learning and Cybernetics, 2012
It is of great use to determine whether a graph is planar in both information technology and engineering areas. Although there are some known algorithms, they are quite difficult to understand and to implement. This paper proposes a new method to determine the planarity of a graph by adjacency matrix, which is very easy to implement.
Shi-Qun Li, Qianli Ma
openaire   +2 more sources

Optical Adjacency Matrix Associative Processor

SPIE Proceedings, 1990
A new bidirectional optical associative processor is described for searching a hierarchical database that is stored as an adjacency matrix. The paper discusses how the processor can answer relatively complex queries on a knowledge base when the queries are formulated as combinations of set closures, unions, intersections, and complementations.
David P. Casasent, Brian A. Telfer
openaire   +2 more sources

Extended Adjacency Matrix Indices and Their Applications

Journal of Chemical Information and Computer Sciences, 1994
In this paper, new topological indices, EA Sigma and EAmax, are introduced. They are based on the extended adjacency matrices of molecules, in which the influences of factors of heteroatoms and multiple bonds were considered.
Chang-Yu Hu, Yi-Qiu Yang, Lu Xu
openaire   +2 more sources

Research and application of adjacent matrix of trees

2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM), 2010
Through studying the adjacency matrix of trees and analyzing the correspondence between the tree and adjacency matrix, the characteristics and storage structure of binary trees' adjacency matrix is summed up in the paper, and the binary trees' A- sequences and B- sequences is solved in parallel by applying adjacent matrix.
Yao Ying-le, Sun Yuqiang, Zhang Ying-li, Xie Jin-feng   +3 more
openaire   +2 more sources

Bounds for eigenvalues of the adjacency matrix of a graph

Journal of Interdisciplinary Mathematics, 2019
AbstractWe obtain bounds for the largest and least eigenvalues of the adjacency matrix of a simple undirected graph. We find upper bound for the second largest eigenvalue of the adjacency matrix.
Pintu Bhunia, Santanu Bag, Kallol Paul
openaire   +2 more sources

Data Clustering by Scaled Adjacency Matrix

2011
Similarity based clustering, which is to find the extrinsic clusters in data by taking as input a collection of real-valued similarities between data points, has been playing an important role in data analysis and engineering. Lots of work had been done in this field.
Caiyan Jia, Jian Yu
openaire   +1 more source

T-matrix method for closely adjacent obstacles

Journal of Quantitative Spectroscopy and Radiative Transfer, 2019
This paper presents a novel method to calculate the T-matrix for two non-spherical obstacles positioned close to each other, where the individual circumscribed spheres intersect. This is achieved by translating the obstacles coordinate systems, using translation matrices for spherical vector waves.
Torleif Martin, Torleif Martin
openaire   +2 more sources

Transforming an adjacency matrix into a planar graph

Building and Environment, 1980
Abstract A model for transforming a non planar graph, presenting the interrelations interrelations required in the adjacency matrix, into a planar one, was developed. This is achieved through cancelling some of the links in the graph. The algorithm is based on trying to minimize two factors: the number of cancelled links and their weight.
A. Wachman, R. Hashimshony, Edna Shaviv
openaire   +2 more sources