World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

A Note on the Steiner k-Diameter of Tensor Product Networks

    Given a graph G(V,E) and SV, the Steiner distance dG(S) is the minimum size among all connected subgraphs of G whose vertex sets contain S. The Steiner k-diameter sdiamk(G) is the maximum value of dG(S) among all sets of k vertices. In this short note, we study the Steiner k-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. J. A. Bondy and U. S. R. Murty, Graph Theory, GTM 244 (Springer, 2008). CrossrefGoogle Scholar
    • 2. G. Chartrand et al., Steiner distance in graphs, Ćasopis pro pěstování matematiky 114 (1989) 399–410. Google Scholar
    • 3. S. L. Hakimi, Steiner’s problem in graph and its implications, Networks 1 (1971) 113–133. CrossrefGoogle Scholar
    • 4. A. Y. Levi, Algorithm for shortest connection of a group of graph vertices, Soviet Mathematics Doklady 1 (1971) 113–133. Google Scholar
    • 5. F. K. Hwang, D. S. Richards and P. Winter, The Steiner Tree Problem (North-Holland, Amsterdam, 1992). Google Scholar
    • 6. Y. Mao, The steiner diameter of a graph, Bulletin of the Iranian Mathematical Society 43(2) (2017) 439–454. ISIGoogle Scholar
    • 7. G. Chartrand, F. Okamoto and P. Zhang, Rainbow trees in graphs and generalized connectivity, Networks 55 (2010) 360–367. ISIGoogle Scholar
    • 8. P. Dankelmann, H. Swart and O. R. Oellermann, Bounds on the Steiner diameter of a graph, Combinatorics, Graph Theory, and Algorithms, Vols. I and II (1996) 269–279. Google Scholar
    • 9. P. Ali, P. Dankelmann and S. Mukwembi, Upper bounds on the Steiner diameter of a graph, Discrete Applied Mathematics 160(12) (2012) 1845–1850. Crossref, ISIGoogle Scholar
    • 10. Z. Wang et al., 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. Y. Mao, E. Cheng and Z. Wang, Steiner distance in product networks, Discrete Mathematics & Theoretical Computer Science 20(2) (2018). Google Scholar
    • 12. K. Day and A.-E. Al-Ayyoub, The cross product of interconnection networks, IEEE Transactions on Parallel and Distributed Systems 8(2) (1997) 109–118. Crossref, ISIGoogle Scholar