Results 91 to 100 of about 8,370 (109)

The Steiner and Gromov–Steiner Ratios and Steiner Subratio in the Space of Compacta in the Euclidean Plane with Hausdorff Distance

Journal of Mathematical Sciences, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the Steiner distance of trees from certain families [PDF]

Australas. J Comb., 1999
The Steiner distance \(d_G(S)\) of a subset \(S\) of vertices in a connected graph \(G= (V,E)\) is the minimum number of edges of a subtree of \(G\) that contains all vertices in \(S\). In this paper, the expected value of the Steiner distance over all trees of order \(n\) and all vertex subsets of \(k\) vertices is studied, as a function of \(k\) and \
Lane H. Clark, Amram Meir, John W. Moon
openaire   +1 more source

On shortest two-connected Steiner networks with Euclidean distance

Networks, 1998
Summary: We consider the problem of constructing the shortest two-connected Steiner network on the Euclidean plane. For a given set \(P\) of points on the Euclidean plane, let \(l_2(P)\) denote the length of the shortest two-connected Steiner network on \(P\) divided by the length of the shortest two-connected spanning network on \(P\). We prove that \(
D. Frank Hsu, Xiao-Dong Hu 0001
openaire   +2 more sources

A Combinatorial Approach to Study the Nordhaus–Guddum-Type Results for Steiner Degree Distance

Mathematics, 2023
Kinkar Chandra Das, Das Kinkar Chandra
exaly  

The Steiner distance of diamond graph

1997
Montenegro'nun çalışmasında [6] bir $K_n$ grafının k tepesinin ardışık olarak $C_{n-1}$ grafının kopyalarıyla yer değiştirmesi sonucu elde edilen $M_k$ grafı incelenmiş ve bu grafın Hamiltonian graf olduğu ispatlanmıştır. Bu çalışmada; $D_{p,n}$ elmas grafı $W_{1,n} = (W_{1,n} = K_1 + C_n )$ tekerleğinin $K_1$ tam grafı ile bir $K_p$ grafının yer ...
openaire   +1 more source

On Steiner’s Problem with Rectilinear Distance

SIAM Journal on Applied Mathematics, 1966
openaire   +1 more source

On the average Steiner 3-eccentricity of trees

Discrete Applied Mathematics, 2021
Sandi Klavžar, Guihai Yu, Guihai Yu
exaly  

Extremal Problems on the Steiner K-Distance and the Steiner K-Wiener Index

2023
Hua Wang, Andrew Zhang
openaire   +1 more source

Weighted connected domination and Steiner trees in distance-hereditary graphs

Discrete Applied Mathematics, 1998
Gérard Jennhwa Chang
exaly  

Nordhaus–Gaddum-Type Results for the Steiner Gutman Index of Graphs

Symmetry, 2020
Yaping Mao, YILUN Shang, Kinkar Chandra Das   +2 more
exaly