Steiner Distance in Product Networks
From MaRDI portal
Publication:4560261
zbMath1401.05098arXiv1703.01410MaRDI QIDQ4560261
Yaping Mao, Zhao Wang, Eddie Cheng
Publication date: 10 December 2018
Full work available at URL: https://arxiv.org/abs/1703.01410
distancediameterCartesian productSteiner treeSteiner distancelexicographical productSteiner \(k\)-diameter
Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (8)
The average Steiner 3-eccentricity of block graphs ⋮ A Note on the Steinerk-Diameter of Tensor Product Networks ⋮ On the average Steiner 3-eccentricity of trees ⋮ The Steiner \(k\)-eccentricity on trees ⋮ A Steiner general position problem in graph theory ⋮ Steiner diameter, maximum degree and size of a graph ⋮ Unnamed Item ⋮ Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
This page was built for publication: Steiner Distance in Product Networks