Results 11 to 20 of about 122,412 (281)
A Note on the Estrada Index of the Aα-Matrix
Mathematics, 2021 Let G be a graph on n vertices. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. V. Nikiforov studied hybrids of A(G) and D(G) and defined the Aα-matrix for every real α∈[0,1] as: Aα(G)=αD(
Jonnathan Rodríguez, Hans Nina
doaj +1 more source
Universal adjacency spectrum of zero divisor graph on the ring and its complement
AKCE International Journal of Graphs and Combinatorics, 2021 For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj +1 more source
The bipartite Laplacian matrix of a nonsingular tree
Special Matrices, 2023 For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B. +2 more
doaj +1 more source
When Can Matrix Query Languages Discern Matrices? [PDF]
, 2020 We investigate when two graphs, represented by their adjacency matrices, can be distinguished by means of sentences formed in MATLANG, a matrix query language which supports a number of elementary linear algebra operators.
Geerts, Floris
core +1 more source
The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
Journal of Mathematics, 2021 All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A=aij=0, if vi=vj or dvi,vj≥21, if dvi,vj=1.. Here in this paper, we discussed new type of adjacency matrix known by 1-2 adjacency
Lubna Gul +3 more
doaj +1 more source
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
The Kernel of the Adjacency Matrix of a Rectangular Mesh [PDF]
Discrete & Computational Geometry, 2002 Given an m x n rectangular mesh, its adjacency matrix A, having only integer entries, may be interpreted as a map between vector spaces over an arbitrary field K. We describe the kernel of A: it is a direct sum of two natural subspaces whose dimensions are equal to $\lceil c/2 \rceil$ and $\lfloor c/2 \rfloor$, where c = gcd (m+1,n+1) - 1. We show that
Carlos Tomei, Tania Vieira
openaire +2 more sources
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
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
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 +1 more source