Results 21 to 30 of about 1,619,561 (291)
BMC Bioinformatics, 2022 Biclustering algorithm is an effective tool for processing gene expression datasets. There are two kinds of data matrices, binary data and non-binary data, which are processed by biclustering method.
He-Ming Chu +5 more
doaj +1 more source
Adjacency Maps and Efficient Graph Algorithms
Algorithms, 2022 Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
doaj +1 more source
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
SSRN Electronic Journal, 2006 Let \(J\) be the all-ones matrix, and let \(A\) denote the adjacency matrix of a graph. It is known that if two graphs are cospectral with respect to \(yJ-A\) for two distinct values of \(y\), then they are cospectral for all \(y\). In this paper the authors focus on \(\hat y\)-cospectral graphs, which are graphs cospectral with respect to \(yJ-A\) for
van Dam, ER, Haemers, WH, Koolen, JH
openaire +9 more sources
Steganalysis by subtractive pixel adjacency matrix [PDF]
Proceedings of the 11th ACM workshop on Multimedia and security, 2009 This paper presents a method for detection of steganographic methods that embed in the spatial domain by adding a low-amplitude independent stego signal, an example of which is least significant bit (LSB) matching. First, arguments are provided for modeling the differences between adjacent pixels using first-order and second-order Markov chains ...
Tomás Pevný +2 more
openaire +2 more sources
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 +4 more
openaire +2 more sources
TRACE OF THE ADJACENCY MATRIX n×n OF THE CYCLE GRAPH TO THE POWER OF TWO TO FIVE
Barekeng, 2022 The main aim of this research is to find the formula of the trace of adjacency matrix from a cycle graph to the power of two to five. To obtain the general form, the first step is finding the general formula of the adjacency matrix from a cycle graph ...
Fitri Aryani +3 more
doaj +1 more source
Social Network of Faculties According to Student Preferences in Transition to Higher Education
Lithuanian Journal of Statistics, 2012 In social network analysis, the studies on weighted adjacency matrix of nodes are increasing day by day. In thispaper, a method is proposed by including node properties to neighbourhood matrix, in order to see the structures of weightedadjacency matrix ...
Güneş Mutlu, Ahmet Mete Çilingirtürk
doaj +1 more source
Vertex adjacency matrix and edge adjacency matrix of a sample graph network.
, 2023 Vertex adjacency matrix and edge adjacency matrix of a sample graph network.
Ertugrul Taciroglu (17692267) +3 more
core +1 more source
Theoretical study of energy, inertia and nullity of phenylene and anthracene
Open Chemistry, 2021 Energy of a molecule plays an important role in physics, chemistry and biology. In mathematics, the concept of energy is used in graph theory to help other subjects such as chemistry and physics.
Ahmad Zaheer +4 more
doaj +1 more source
On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]
Engineering and Technology Journal, 2013 This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab +2 more
doaj +1 more source