A Note on the Steiner k-Diameter of Tensor Product Networks
Abstract
Given a graph and , the Steiner distance is the minimum size among all connected subgraphs of whose vertex sets contain . The Steiner -diameter is the maximum value of among all sets of vertices. In this short note, we study the Steiner -diameters of the tensor product of complete graphs.
This research began as a project at the 2018 Oakland University Summer Mathematics Institute, and earned a First Place Award in Mathematics and a Naval Scholar Award at the 2019 Science and Engineering Fair of Metro Detroit.
References
- 1. , Graph Theory,
GTM 244 (Springer, 2008). Crossref, Google Scholar - 2. , Steiner distance in graphs, Ćasopis pro pěstování matematiky 114 (1989) 399–410. Google Scholar
- 3. , Steiner’s problem in graph and its implications, Networks 1 (1971) 113–133. Crossref, Google Scholar
- 4. , Algorithm for shortest connection of a group of graph vertices, Soviet Mathematics Doklady 1 (1971) 113–133. Google Scholar
- 5. , The Steiner Tree Problem (North-Holland, Amsterdam, 1992). Google Scholar
- 6. , The steiner diameter of a graph, Bulletin of the Iranian Mathematical Society 43(2) (2017) 439–454. ISI, Google Scholar
- 7. , Rainbow trees in graphs and generalized connectivity, Networks 55 (2010) 360–367. ISI, Google Scholar
- 8. ,
Bounds on the Steiner diameter of a graph , Combinatorics, Graph Theory, and Algorithms, Vols. I and II (1996) 269–279. Google Scholar - 9. , Upper bounds on the Steiner diameter of a graph, Discrete Applied Mathematics 160(12) (2012) 1845–1850. Crossref, ISI, Google Scholar
- 10. , Steiner distance in join, corona, and threshold graphs, in Proceedings to the Fourteenth International Symposium on Pervasive, Algorithms, and Networks, (
2017 ), pp. 100–104. Google Scholar - 11. , Steiner distance in product networks, Discrete Mathematics & Theoretical Computer Science 20(2) (2018). Google Scholar
- 12. , The cross product of interconnection networks, IEEE Transactions on Parallel and Distributed Systems 8(2) (1997) 109–118. Crossref, ISI, Google Scholar


