Distance distributions for graphs modeling computer networks
DOI10.1016/J.DAM.2007.07.020zbMATH Open1126.05044OpenAlexW2014049225MaRDI QIDQ2462402FDOQ2462402
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
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
Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Distance in graphs (05C12) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Wiener number of vertex-weighted graphs and a chemical application
- Title not available (Why is that?)
- On some counting polynomials in chemistry
- Distances in benzenoid systems: Further developments
- The computation of the distance matrix and the Wiener index for graphs of arbitrary complexity with weighted vertices and edges
- Title not available (Why is that?)
Cited In (18)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- Distributed distance measurement for large-scale networks.
- The structure of distances in networks
- Graph Distances in the Data-Stream Model
- Modeling Network Populations via Graph Distances
- The Hosoya polynomial of double weighted graphs
- Title not available (Why is that?)
- Wiener index of iterated line graphs of trees homeomorphic to \(H\)
- Distance-sum heterogeneity in graphs and complex networks
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- Title not available (Why is that?)
- Distance distribution of nodes in star graphs
- On the distance between random events on a network
- Title not available (Why is that?)
- The obnoxious center problem on weighted cactus graphs.
- On the sum of all distances in bipartite graphs
- Comparison of mean distance in superposed networks
- Broadcasting on cactus graphs
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)
