A Note on the Steinerk-Diameter of Tensor Product Networks

DOI10.1142/S0129626419500087zbMath1492.05134OpenAlexW2966573033MaRDI QIDQ5087855

Pranav Arunandhi, Eddie Cheng, Christopher Melekian

Publication date: 4 July 2022

Published in: Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129626419500087

zbMATH Keywords

tensor productSteiner diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Upper bounds on the Steiner diameter of a graph
• The Steiner tree problem
• Rainbow trees in graphs and generalized connectivity
• Steiner distance in graphs
• Steiner Distance in Product Networks
• The Steiner diameter of a graph
• Steiner's problem in graphs and its implications

This page was built for publication: A Note on the Steinerk-Diameter of Tensor Product Networks