Results 11 to 20 of about 1,619,561 (291)
Adjacency Matrix of Product of Graphs
Kalpa Publications in Computing, 2018 In graph theory, different types of matrices associated with graph, e.g. Adjacency matrix, Incidence matrix, Laplacian matrix etc. Among all adjacency matrix play an important role in graph theory. Many products of two graphs as well as its generalized form had been studied, e.g., cartesian product, 2−cartesian product, tensor product, 2−tensor product
Urvashi Acharya, Himali Mehta
openaire +3 more sources
The k-adjacency operators and adjacency Jacobi matrix on distance-regular graphs [PDF]
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 ...
Rios-Cangas, Josué I.
openaire +3 more sources
Reducing the adjacency matrix of a tree [PDF]
The Electronic Journal of Linear Algebra, 1996 Summary: Let \(T\) be a tree, \(A\) its adjacency matrix, and \(\alpha\) be a scalar. We describe a linear-time algorithm for reducing the matrix \(\alpha I_n + A\). Applications include computing the rank of \(A\), finding a maximum matching in \(T\), computing the rank and determinant of the associated neighborhood matrix, and computing the ...
Fricke, Gerd H. +3 more
core +4 more sources
Ranking hubs and authorities using matrix functions [PDF]
, 2013 The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks.
Estrada, Ernesto +2 more
core +4 more sources
, 2022 Adjacency matrix of mechanosensitive subnetwork.
Peter Eipert (14026368) +5 more
core +3 more sources
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
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
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 +3 more sources