Wiener indices of hex carpets---from hexagon models to square grids

MaRDI QIDQ1907265zbMATH OpenFDO

Authors I-Wen Huang, Bo-Yin Yang, Yeong-Nan Yeh

Publication date 18 July 1996

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancehex carpetstilingWiener index

Mathematics Subject Classification ID

Distance in graphs (05C12) Applications of graph theory (05C90)

Review text

Let \(d\) be the distance function of a connected graph \(G= (V, E)\). Harold Wiener introduced the following characteristic of \(G\): \[ {\mathcal W}(G):= \sum_{\{u, v\}\subset V} d(u, v). \] Now this characteristic is usually called Wiener index (some other names are also used). The paper is devoted to Wiener indices of so-called hex carpets, that is graphs which in a natural way correspond to ``nice parts of the standard hexagonal tiling of the plane.

Recommendations

• Wiener index of hexagonal systems
• The Wiener number of the hexagonal net
• A Crowning Moment for Wiener Indices
• Wiener number of hexagonal jagged-rectangles
• scientific article; zbMATH DE number 1285528

Cited in

(3)

• Generalized Wiener indices of zigzagging pentachains
• A Crowning Moment for Wiener Indices
• Topographical distance matrices for porous arrays

This page was built for publication: Wiener indices of hex carpets---from hexagon models to square grids

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