Distance distributions for graphs modeling computer networks

DOI10.1016/J.DAM.2007.07.020MaRDI QIDQ2462402zbMATH OpenOpenAlexFDO

Authors Bruce Elenbogen, John Frederick Fink

Publication date 30 November 2007

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

Full work available at URL https://doi.org/10.1016/j.dam.2007.07.020

zbMATH Keywords

computer networkdistancedistance distributionWiener indexWiener polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Distance in graphs (05C12) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The structure of distances in networks
• scientific article; zbMATH DE number 6701955
• On Distances in Uniformly Random Networks
• Modeling Network Populations via Graph Distances
• Network distances for weighted digraphs
• Measuring distances between complex networks
• Distances in random Apollonian network structures
• Joint distribution of distances in large random regular networks
• Distance-sum heterogeneity in graphs and complex networks
• Typical distances in a geometric model for complex networks

Cites work

• Distances in benzenoid systems: Further developments
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• scientific article; zbMATH DE number 892007 (Why is no real title available?)
• On some counting polynomials in chemistry
• The computation of the distance matrix and the Wiener index for graphs of arbitrary complexity with weighted vertices and edges
• Wiener number of vertex-weighted graphs and a chemical application

Cited in

(18)

• Distributed distance measurement for large-scale networks.
• The obnoxious center problem on weighted cactus graphs.
• Wiener index of iterated line graphs of trees homeomorphic to \(H\)
• A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
• Distance distribution of nodes in star graphs
• Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
• On the sum of all distances in bipartite graphs
• scientific article; zbMATH DE number 6701955 (Why is no real title available?)
• Graph Distances in the Data-Stream Model
• The structure of distances in networks
• Distance-sum heterogeneity in graphs and complex networks
• The Hosoya polynomial of double weighted graphs
• Broadcasting on cactus graphs
• scientific article; zbMATH DE number 270113 (Why is no real title available?)
• scientific article; zbMATH DE number 2230281 (Why is no real title available?)
• Modeling Network Populations via Graph Distances
• On the distance between random events on a network
• Comparison of mean distance in superposed networks

This page was built for publication: Distance distributions for graphs modeling computer networks

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