Abstract
In this paper we prove some bounds for Steiner distance in Cartesian product. We investigate properties of connected subgraphs that are not Steiner convex. Those results are the key in the characterization of Steiner convex sets of grids and also in the characterization of 3-Steiner convex sets of Cartesian product graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Malaysian Mathematical Sciences Society
Paper Title
Journal
Date
