Summing the shortest path lengths in a rectangular lattice via recursion

DOI10.17654/JPANTADEC2015_249_259MaRDI QIDQ2794886zbMATH OpenOpenAlexFDO

Authors Michael A. Nyblom

Publication date 11 March 2016

Published in JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/9475.htm

zbMATH Keywords

square latticeWiener index

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Recurrences (11B37)

Recommendations

• On the average path length of complete m-ary trees
• A formula of average path length for unweighted networks
• Asymptotic formula on average path length of a special network based on Sierpinski carpet
• Enumerating shortest paths and determining edge betweenness centrality in Cartesian products of paths and cycles
• Asymptotic formula on average path length in a hierarchical scale-free network with fractal structure

Cited in

(2)

• On the average path length of complete m-ary trees
• On the complexity of average path length for biological networks and patterns

This page was built for publication: Summing the shortest path lengths in a rectangular lattice via recursion

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