Weighted chained graphs and some applications

DOI10.1016/J.APNUM.2023.12.017MaRDI QIDQ7031608zbMATH OpenFDO

Authors C. Fenu, Lothar Reichel, G. Rodriguez, Y. Zhang

Publication date 6 February 2025

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APNUM.2023.12.017

zbMATH Keywords

broadcasting setcentral vertexnetwork analysisreceiving setweighted chained graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Review text

This paper considers both directed and undirected graphs. First, the paper introduces the notion of weighted chained graphs. This concept extends the idea of chained graphs. The paper generalizes several results on chained structure for unweighted undirected graphs to weighted directed graphs. The paper also defines the notions of node centrality for directed and weighted graphs. Further, the notion of minimum broadcasting and receiving sets is introduced. Chained structures and spanning forests help determine such sets. Finally, the authors illustrate how the broadcasting and receiving sets and their associated chained structure can be determined in real-world transportation networks.

Cites work

• Block matrix formulations for evolving networks
• Communication in complex networks
• Estimating and increasing the structural robustness of a network
• scientific article; zbMATH DE number 5977361 (Why is no real title available?)
• Networks. An introduction.

This page was built for publication: Weighted chained graphs and some applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031608)