Wiener Index of Hypertree
From MaRDI portal
Publication:3296832
DOI10.1007/978-3-030-01123-9_49zbMath1442.05038OpenAlexW2913674053MaRDI QIDQ3296832
No author found.
Publication date: 2 July 2020
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-01123-9_49
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Data structures (68P05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Terminal Wiener index
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Wirelength of hypercubes into certain trees
- Embedding trees in recursive circulants
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Intuitionistic fuzzy hypergraphs with applications
- Embedding of cycles and wheels into arbitrary trees
- Transversals of subtree hypergraphs and the source location problem in digraphs
- Wiener index of trees: Theory and applications
This page was built for publication: Wiener Index of Hypertree