Results 261 to 270 of about 1,735,900 (276)
Some of the next articles are maybe not open access.

On the Steiner distance of trees from certain families

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   +2 more sources

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 the average Steiner 3-eccentricity of trees

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

Weighted connected domination and Steiner trees in distance-hereditary graphs

Discrete Applied Mathematics, 1998
Gerard Jennhwa Chang
exaly  

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

Symmetry, 2020
Yaping Mao   +2 more
exaly  

The Steiner -Wiener index of graphs with given minimum degree

Discrete Applied Mathematics, 2019
Peter Dankelmann
exaly  

Home - About - Disclaimer - Privacy