Results 11 to 20 of about 121,408 (279)

Adjacency Matrix of a Semigraph

open access: yesElectronic 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.
Y.S. Gaidhani   +2 more
openaire   +3 more sources

Relationship between adjacency and distance matrix of graph of diameter two

open access: yesIndonesian Journal of Combinatorics, 2021
The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property.
Siti L. Chasanah   +3 more
doaj   +1 more source

Some New Bounds for α-Adjacency Energy of Graphs

open access: yesMathematics, 2023
Let G be a graph with the adjacency matrix A(G), and let D(G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), 0≤α≤1, which shed new light on A(G) and Q(G)=D(G)+A(G), and yielded some ...
Haixia Zhang, Zhuolin Zhang
doaj   +1 more source

Universal adjacency spectrum of zero divisor graph on the ring and its complement

open access: yesAKCE 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

open access: yesMathematics, 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]

open access: yes, 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 bipartite Laplacian matrix of a nonsingular tree

open access: yesSpecial 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]

open access: yesProceedings 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

open access: yesJournal 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

A binary biclustering algorithm based on the adjacency difference matrix for gene expression data analysis

open access: yesBMC 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

Home - About - Disclaimer - Privacy