Results 1 to 10 of about 72 (67)
A Combinatorial Approach to Study the Nordhaus–Guddum-Type Results for Steiner Degree Distance
Mathematics, 2023 In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph Γ. Let dΓ(S) be the Steiner k-distance of S⊆V(Γ). The Steiner Wiener k-index or k-center Steiner Wiener indexSWk(Γ) of Γ is defined by SWk(Γ)=∑|S|=kS⊆V(Γ)
Hongfang Liu +3 more
doaj +3 more sources
Steiner distance matrix of caterpillar graphs
Special Matrices, 2022 In this article, we show that the rank of the 2-Steiner distance matrix of a caterpillar graph having NN vertices and pp pendant veritices is 2N−p−12N-p-1.
Azimi Ali +2 more
doaj +2 more sources
A generalization of the Graham-Pollak tree theorem to even-order Steiner distance
Special MatricesGraham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero.
Cooper Joshua, Tauscheck Gabrielle
doaj +2 more sources
Steiner Wiener Index of Certain Windmill Graphs.
Zanco Journal of Pure and Applied Sciences, 2023 For a connected graph of order and a non-empty subset , the - Steiner distance of is defined to be the smallest size among all connected subgraphs whose vertex sets contain .
Herish Omer Abdullah
doaj +1 more source
Steiner Distance in Product Networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers with $2\
Yaping Mao, Eddie Cheng, Zhao Wang
doaj +1 more source
Hosoya Polynomials of Steiner Distance of an m-Cube and the Square of a Path [PDF]
مجلة التربية والعلم, 2008 The Hosoya polynomials of Steiner 3-distance of hypercube graphs , and of the square of a path, , are obtained in this paper. The Steiner n-diameters of and are also obtained.
Ali Ali, Herish Abdullah
doaj +1 more source
On a Combinatorial Approach to Studying the Steiner Diameter of a Graph and Its Line Graph
Mathematics, 2022 In 1989, Chartrand, Oellermann, Tian and Zou introduced the Steiner distance for graphs. This is a natural generalization of the classical graph distance concept. Let Γ be a connected graph of order at least 2, and S\V(Γ).
Hongfang Liu +3 more
doaj +1 more source
Examination of the horizontal position of the lips in relation to reference lines in the population of young adults [PDF]
Medicinski Podmladak, 2023 Introduction: Facial beauty mostly depends on the correct mutual relations of the upper and lower jaw, along with the jaw and teeth, which results in different convexity and shape of the lips, causing the unique morphology of an individual's lips.
Kovačević Olivera, Erić Mirela
doaj +1 more source
Multicenter Wiener indices and their applications [PDF]
Journal of the Serbian Chemical Society, 2015 The Wiener index W can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms. A generalization of the W are the Steiner-Wiener indices kW, k=3,4,....
Gutman Ivan, Furtula Boris, Li Xueliang
doaj +1 more source
Steiner Wiener index of block graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let S be a set of vertices of a connected graph G. The Steiner distance of S is the minimum size of a connected subgraph of G containing all the vertices of S.
Matjaž Kovše +2 more
doaj +1 more source