Results 31 to 40 of about 28,893 (164)
KAMG: A Tool for Converting Blood Ties and Affinity Ties into Adjacency Matrices
Journal of Open Research Software, 2016 Kinship Adjacency Matrix Generator (KAMG) is a browser-based software for creating adjacency matrices using the information of kinship ties. Specifically, it is capable of converting the family trees in the format of GEDCOM files into adjacency matrices ...
Hang Xiong, Pin Xiong, Hui Xiong
doaj +1 more source
Deep Learning Techniques for Community Detection in Social Networks
IEEE Access, 2020 Graph embedding is an effective yet efficient way to convert graph data into a low dimensional space. In recent years, deep learning has applied on graph embedding and shown outstanding performance.
Ling Wu +4 more
doaj +1 more source
The k-adjacency operators and adjacency Jacobi matrix on distance-regular graphs
Boletín de la Sociedad Matemática Mexicana, 2023 We deal in this work with a class of graphs, namely, the class of distance-regular graphs, in which on the basis of $k$-adjacency operators, the adjacency operator $A$ of a distance-regular graph is identified as a Jacobi matrix. To get so, the set of the $k$-adjacency operators is recognized as a canonical basis in a certain Hilbert space, where the ...
openaire +2 more sources
Contribution of directedness in graph spectra
Physical Review Research, 2022 In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
A new matrix representation of multidigraphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this article, we introduce a new matrix associated with a multidigraph, named as the complex adjacency matrix. We study the spectral properties of bipartite multidigraphs corresponding to the complex adjacency matrix.
Sasmita Barik, Gopinath Sahoo
doaj +1 more source
Moment-Based Spectral Analysis of Large-Scale Generalized Random Graphs
IEEE Access, 2017 This paper investigates the spectra of the adjacency matrix and Laplacian matrix for an artificial complex network model-the generalized random graph. We deduce explicit expressions for the first four asymptotic spectral moments of the adjacency matrix ...
Qun Liu, Zhishan Dong, En Wang
doaj +1 more source
Interval Valued Secondary k-Range Symmetric Quadri Partitioned Neutrosophic Fuzzy Matrices with Decision Making [PDF]
Neutrosophic Sets and SystemsThe objective of this study is to establish the results concerning Interval-Valued (IV) Secondary k-Range Symmetric (RS) Quadri Partitioned Neutrosophic Fuzzy Matrices (QPNFM).
K. Radhika +5 more
doaj +1 more source
Spatial‐temporal slowfast graph convolutional network for skeleton‐based action recognition
IET Computer Vision, 2022 In skeleton‐based action recognition, the graph convolutional network (GCN) has achieved great success. Modelling skeleton data in a suitable spatial‐temporal way and designing the adjacency matrix are crucial aspects for GCN‐based methods to capture ...
Zheng Fang +4 more
doaj +1 more source
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
Journal of Hebei University of Science and Technology, 2019 In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n－4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characterized ...
Hongjuan JU, Yingjie LEI
doaj +1 more source
On the second minimizing graph in the set of complements of trees
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of ...
M. Javaid
doaj +1 more source