Returnability in complex directed networks (digraphs)

DOI10.1016/j.laa.2008.09.033zbMath1225.05108OpenAlexW2067168204MaRDI QIDQ1014455

Ernesto Estrada, Naomichi Hatano

Publication date: 29 April 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/14343/7/strathprints014343.pdf

zbMATH Keywords

digraphsreciprocityEstrada indexcomplex networksgraph spectrumreturnability

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Vertex-degree-based topological indices of oriented trees ⋮ Returnability as a criterion of disequilibrium in atmospheric reactions networks ⋮ A statistical mechanics description of environmental variability in metabolic networks ⋮ Quadrature rule-based bounds for functions of adjacency matrices

Uses Software

• Pajek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth function topological structure descriptors based on graph-spectra
• Estimating the Estrada index
• Network Properties Revealed through Matrix Functions
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

This page was built for publication: Returnability in complex directed networks (digraphs)