Results 21 to 30 of about 137,715 (267)
Role of Adjacency Matrix & Adjacency List in Graph Theory
Bioinformatics, 2012 Today, graph theory has become major instrument that is used in an array of fields. Some of these include electrical engineering, mathematical research, sociology, economics, computer programming/networking, business administration and marketing. Indeed,
Harmanjit Singh, Richa Sharma
core +2 more sources
Reducing the adjacency matrix of a tree
, 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 ...
Hedetniemi, Stephen +8 more
core +2 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
, 2022 Adjacency matrix of mechanosensitive subnetwork.
Peter Eipert (14026368) +5 more
core +3 more sources
General Zagreb Adjacency Matrix
Contributions to Mathematics, 2022 Let A ( G ) and D ( G ) be the adjacency matrix and the degree diagonal matrix of a graph G , respectively. For any real number α , the general Zagreb adjacency matrix of G is defined as Z α ( G ) = D α ( G )+ A ( G ) .
Zhen Lin
semanticscholar +1 more source
On the adjacency matrix of a complex unit gain graph [PDF]
Linear and multilinear algebra, 2018 A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge.
Ranjit Mehatari +2 more
semanticscholar +1 more source
Combinatorics of Nahm sums, quiver resultants and the K-theoretic condition
Journal of High Energy Physics, 2021 Algebraic Nahm equations, considered in the paper, are polynomial equations, governing the q → 1 limit of the q-hypergeometric Nahm sums. They make an appearance in various fields: hyperbolic geometry, knot theory, quiver representation theory ...
Dmitry Noshchenko
doaj +1 more source
Wiener index and addressing of some finite graphs
AKCE International Journal of Graphs and Combinatorics, 2023 An addressing of length t of a graph G is an assignment of t-tuples with entries in [Formula: see text] called addresses, to the vertices of G such that the distance between any two vertices can be determined from their addresses.
Mona Gholamnia Taleshani, Ahmad Abbasi
doaj +1 more source
A Note on Some Bounds of the α-Estrada Index of Graphs
Advances in Mathematical Physics, 2020 Let G be a simple graph with n vertices. Let A~αG=αDG+1−αAG, where 0≤α≤1 and AG and DG denote the adjacency matrix and degree matrix of G, respectively. EEαG=∑i=1neλi is called the α-Estrada index of G, where λ1,⋯,λn denote the eigenvalues of A~αG.
Yang Yang, Lizhu Sun, Changjiang Bu
doaj +1 more source
New Bounds for the α-Indices of Graphs
Mathematics, 2020 Let G be a graph, for any real 0≤α≤1, Nikiforov defines the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), where A(G) and D(G) are the adjacency matrix and diagonal matrix of degrees of the vertices of G.
Eber Lenes +2 more
doaj +1 more source