Results 41 to 50 of about 28,893 (164)
Hierarchical data structures for flowchart
Scientific Reports, 2023 Flowcharts have broad applications in the fields of software development, engineering design, and scientific experimentation. Current flowchart data structure is mainly based on the adjacency list, cross-linked list, and adjacency matrix of the graph ...
Peng Zhang, Wenzhang Dou, Huaping Liu
doaj +1 more source
Role of Adjacency Matrix & Adjacency List in Graph Theory
INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY, 2012 Today, graph theory has become major instrument that is used in an array of fields. Some of these include electrical engineering, mathematical research, sociology, economics, computer programming/networking, business administration and marketing. Indeed, many problems can be modeled with paths formed by traveling along the edges of a certain graph ...
Harmanjit Singh, Richa Sharma
openaire +2 more sources
Determinantal properties of Boolean graphs using recursive approach
AKCE International Journal of Graphs and CombinatoricsThe aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of the adjacency
Gahininath Sonawane +2 more
doaj +1 more source
Fuzzy Adjacency Matrix In Graphs
, 2011 In this paper a new definition of adjacency matrix in the simple graphs is presented that is called fuzzy adjacency matrix, so that elements of it are in the form of 0 and n N n 1 , ∈ that are in the interval [0, 1], and then some charactristics of this matrix are presented with the related examples .
Taheri, Mahdi, Mehrana Niroumand
openaire +1 more source
Adjacency Matrix based Face Recognition Approach [PDF]
International Journal of Computer Applications, 2014 Biometric based techniques have emerged as the most promising option for recognizing individuals in recent years, for authenticating people and granting them access. Face recognition provide a biometric based authentication, authorization, surveillance services. Face recognition has gained increasing interest in the recent decade.
Pankaj Kaushik, Harish Rohil
openaire +1 more source
Generating Adjacency Matrix for Video Relocalization
, 2020 In this paper, we continue our work on video relocalization task. Based on using graph convolution to extract intra-video and inter-video frame features, we improve the method by using similarity-metric based graph convolution, whose weighted adjacency matrix is achieved by calculating similarity metric between features of any two different time steps ...
Zhou, Yuan +3 more
openaire +2 more sources
Distributed stochastic gradient descent for link prediction in signed social networks
EURASIP Journal on Advances in Signal Processing, 2019 This paper considers the link prediction problem defined over a signed social network, where the relationship between any two network users can be either positive (friends) or negative (foes).
Han Zhang, Gang Wu, Qing Ling
doaj +1 more source
Laplacian versus adjacency matrix in quantum walk search [PDF]
Quantum Information Processing, 2016 A quantum particle evolving by Schr dinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk.
Thomas G. Wong +2 more
openaire +3 more sources
Cospectral constructions for several graph matrices using cousin vertices
Special Matrices, 2021 Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs [PDF]
Journal of Graph Theory, 2016 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.
Guo, Krystal, Mohar, Bojan
openaire +2 more sources