Distance distributions for graphs modeling computer networks
From MaRDI portal
Publication:2462402
DOI10.1016/j.dam.2007.07.020zbMath1126.05044OpenAlexW2014049225MaRDI QIDQ2462402
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
Exact enumeration problems, generating functions (05A15) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Related Items (9)
Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index ⋮ On the distance between random events on a network ⋮ Wiener index of iterated line graphs of trees homeomorphic to \(H\) ⋮ The obnoxious center problem on weighted cactus graphs. ⋮ On the sum of all distances in bipartite graphs ⋮ The Hosoya polynomial of double weighted graphs ⋮ Broadcasting on cactus graphs ⋮ Unnamed Item ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some counting polynomials in chemistry
- Wiener number of vertex-weighted graphs and a chemical application
- 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
This page was built for publication: Distance distributions for graphs modeling computer networks
