A Steiner general position problem in graph theory
Sign Up to like & getrecommendations! Published in 2021 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-021-01619-y
Abstract: Let G be a graph. The Steiner distance of W ⊆ V (G) is the minimum size of a connected subgraph of G containing W . Such a subgraph is necessarily a tree called a… read more here.
Keywords: steiner general; position problem; graph; steiner ... See more keywords