Steiner distance in graphs
Work
Year: 1989
Type: article
Abstract: For a nonempty set S of vertices of a connected graph G, the distance d(S) of S is the minimum size of a connected subgraph whose vertex set contains S. For integers n and p with 2 5^ n ^. p, the mini... more
Source: Časopis pro pěstování matematiky
Cites: 2
Cited by: 99
Related to: 10
FWCI: 0.367
Citation percentile (by year/subfield): 91.96
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold