Results 31 to 40 of about 2,956,415 (357)
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
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
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
Journal of Physics: Conference Series, 2021 A directed graph can be represented by several matrix representations, such as the anti-adjacency matrix. This paper discusses the general form of characteristic polynomial and eigenvaluesof the anti-adjacencymatrix of directed unicyclic corona graph ...
N. Hasyyati, K. Sugeng, S. Aminah
semanticscholar +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
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áš Pevny +2 more
openaire +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
Wasserstein metric for improved quantum machine learning with adjacency matrix representations [PDF]
Machine Learning: Science and Technology, 2020 We study the Wasserstein metric to measure distances between molecules represented by the atom index dependent adjacency ‘Coulomb’ matrix, used in kernel ridge regression based supervised learning. Resulting machine learning models of quantum properties,
O. Çaylak +3 more
semanticscholar +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
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