Results 11 to 20 of about 2,481,483 (231)

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, Benzi, Michele, Klymko, Christine   +2 more
core   +4 more sources

Adjacency matrix.

, 2022
Adjacency matrix of mechanosensitive subnetwork.
Peter Eipert (14026368), Marc-Thorsten Hütt (35570), Claus Hilgetag (3140412), Oliver Schmitt (159300), Vishnu Prathapan (14026371), Christian Nitzsche (14026365)   +5 more
core   +3 more sources

Aα-Spectral Characterizations of Some Joins

Journal of Mathematics, 2020
Let G be a graph with n vertices. For every real α∈0,1, write AαG for the matrix AαG=αDG+1−αAG, where AG and DG denote the adjacency matrix and the degree matrix of G, respectively.
Tingzeng Wu, Tian Zhou
doaj   +1 more source

On the A_α-Eigenvalues of Signed Graphs

Mathematics, 2021
For α∈[0,1], let Aα(Gσ)=αD(G)+(1−α)A(Gσ), where G is a simple undirected graph, D(G) is the diagonal matrix of its vertex degrees and A(Gσ) is the adjacency matrix of the signed graph Gσ whose underlying graph is G.
Germain Pastén, Oscar Rojo, Luis Medina
doaj   +1 more source

Graphs Whose Aα -Spectral Radius Does Not Exceed 2

Discussiones Mathematicae Graph Theory, 2020
Let A(G) and D(G) be the adjacency matrix and the degree matrix of a graph G, respectively. For any real α ∈ [0, 1], we consider Aα (G) = αD(G) + (1 − α)A(G) as a graph matrix, whose largest eigenvalue is called the Aα -spectral radius of G.
Wang Jian Feng, Wang Jing, Liu Xiaogang, Belardo Francesco   +3 more
doaj   +1 more source

Directed random geometric graphs: structural and spectral properties

Journal of Physics: Complexity, 2022
In this work we analyze structural and spectral properties of a model of directed random geometric graphs: given n vertices uniformly and independently distributed on the unit square, a directed edge is set between two vertices if their distance is ...
Kevin Peralta-Martinez, J A Méndez-Bermúdez   +1 more
doaj   +1 more source

On the A_α-Spectral Radii of Cactus Graphs

Mathematics, 2020
Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang, Shaohui Wang, Jia-Bao Liu, Bing Wei   +3 more
doaj   +1 more source

Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications

Discussiones Mathematicae Graph Theory, 2020
Given a graph G, its adjacency matrix A(G) and its diagonal matrix of vertex degrees D(G), consider the matrix Aα (G) = αD(G) + (1 − α)A(G), where α ∈ [0, 1).
Cardoso Domingos M., Pastén Germain, Rojo Oscar   +2 more
doaj   +1 more source

Vertex adjacency matrix and edge adjacency matrix of a sample graph network.

, 2023
Vertex adjacency matrix and edge adjacency matrix of a sample graph network.
Ertugrul Taciroglu (17692267), Sven Malama (17692264), Debasish Jana (1953253), Sriram Narasimhan (4403962)   +3 more
core   +1 more source

Schema of the adjacency matrix.

, 2023
The elements of the adjacency matrix are the weights of links. Each row of the adjacency matrix contains the weights of in-links for the corresponding node, and the number of nonzero entries is its in-degree. Similarly, each column carries the weights of
Ilias Rentzeperis (10215602), Jia Li (160557), Cees van Leeuwen (255734)   +2 more
core   +1 more source