Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,130,276 papers from all fields of science
Search
Sign In
Create Free Account
Adjacency matrix
Known as:
Adjacency-matrix representation
, Sociomatrix
, Connectivity matrix
Expand
In graph theory, computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency algebra
Adjacency list
Alexandru Balaban
Bipartite double cover
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
A Comparative Study of a Few Tests for Isomorphism in Planetary Gear Trains
R. Reddy
,
A. Gupta
,
Y. Rao
2013
Corpus ID: 212491178
Graph theory and Matrix methods are widely used by various kinematicians for synthesis and analysis of PGTs. Characteristic…
Expand
2013
2013
4451 Resting-State Functional Hubs at Multiple Frequencies Revealed by MR-Encephalography
Hsu-Lei Lee
,
J. Assländer
,
P. LeVan
,
J. Hennig
2013
Corpus ID: 53648830
Resting-State Functional Hubs at Multiple Frequencies Revealed by MR-Encephalography Hsu-Lei Lee, Jakob Assländer, Pierre LeVan…
Expand
2010
2010
Robust Independence-Based Causal Structure Learning in Absence of Adjacency Faithfulness
J. Lemeire
,
S. Meganck
,
F. Cartella
2010
Corpus ID: 18091776
This paper presents an extension to the Conservative PC algorithm which is able to detect violations of adjacency faithfulness…
Expand
2006
2006
A Multigrid-Fourier Method for the Computation of Elastic Fields with Application to Heteroepitaxy
G. Russo
,
P. Smereka
Multiscale Modeling & simulation
2006
Corpus ID: 9444348
A multigrid-Fourier method is formulated for the computation of elastic fields with applications to heteroepitaxy. A discrete…
Expand
2001
2001
Hazard elimination using backwards reachability techniques in discrete and hybrid models
N. Neogi
2001
Corpus ID: 106836095
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, February 2002.
1997
1997
Dense Graphs and Sparse Matrices
M. Randić
,
L. Dealba
Journal of chemical information and computer…
1997
Corpus ID: 206887862
We consider rigorous definitions for dense graphs and sparse matrices, thus quantifying these concepts that have been hitherto…
Expand
1983
1983
The rank of the adjacency matrix of a graph
C. V. Nuffelen
1983
Corpus ID: 124541326
Soit A la matrice adjacente de G et r(G) le rang de A. On montre qu'il existe plusieurs relations entre r(G) et d'autres nombres…
Expand
1978
1978
On the Characterization of Balancing Processes of Social Systems and the Derivation of the Minimal Balancing Processes
O. Katai
,
S. Iwai
IEEE Transactions on Systems, Man and Cybernetics
1978
Corpus ID: 29421116
The psychological notion of cognitive balance by Cartwright and Harary offers a well-organized mode for consideration of systems…
Expand
1967
1967
Conversion of Wiswesser Notation to a Connectivity Matrix for Organic Compounds
E. Hyde
,
F. W. Matthews
,
L. Thomson
,
W. J. Wiswesser
1967
Corpus ID: 62231972
1950
1950
A Method for Analyzing the Sociomatrix
Corlin O. Beum join
,
Everett G. Brundage
1950
Corpus ID: 126397189