Results 21 to 30 of about 113,956 (308)
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
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
Reducing the adjacency matrix of a tree [PDF]
The Electronic Journal of Linear Algebra, 1996 Let T be a tree, A its adjacency matrix, and a scalar. We describe a linear-time algorithm for reducing the matrix In +A. Applications include computing the rank of A, nding a maximum matching in T , computing the rank and determinant of the associated neighborhood matrix, and computing the characteristic polynomial of A.
David P. Jacobs +3 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
Adjacency Matrix of a Semigraph
Electronic Notes in Discrete Mathematics, 2017 Abstract Semigraph was defined by Sampathkumar as a generalization of a graph. In this paper the adjacency matrix which represents semigraph uniquely and a characterization of such a matrix is obtained. An algorithm to construct the semigraph from a given square matrix, if semigraphical is given.
Bhagyashree Athawale +2 more
openaire +1 more source
On the inverse of the adjacency matrix of a graph
Special Matrices, 2013 A real symmetric matrix G with zero diagonal encodes the adjacencies of the vertices of a graphG with weighted edges and no loops. A graph associated with a n◊n non‐singular matrix with zero entries on the diagonal such that all its (n 1)◊ (n 1) principal submatrices are singular is said to be a NSSD.
Farrugia, Alexander +2 more
openaire +4 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
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 ...
Jessica Fridrich +2 more
openaire +3 more sources