Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Steiner Degree Distances (CROSBI ID 243980)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Mao, Yaping ; Wang, Zhao ; Gutman, Ivan ; Klobučar, Antoaneta Steiner Degree Distances // MATCH : communications in mathematical and in computer chemistry, 78 (2017), 221-230

Podaci o odgovornosti

Mao, Yaping ; Wang, Zhao ; Gutman, Ivan ; Klobučar, Antoaneta

engleski

Steiner Degree Distances

The concept of degree distance $DD(G)$ of a connected graphs $G$ was introduced by Dobrynin and Kochetova in 1994. Recently, Gutman introduced the concept of $k$-center Steiner degree distance of a graph. The \emph{;$k$-center Steiner degree distance}; $DD_k(G)$ of a connected graph $G$ is defined by $SDD_k(G)=\sum_{;\overset{;S\subseteq V(G)};{;|S|=k};};\left(\sum_{;v\in S};deg_G(v)\right) d_G(S)$, where $d_G(S)$ is the Steiner $k$-distance of $S$ and $deg_G(v)$ is the degree of the vertex $v$ in $G$. Expressions for $SW_k$ for some special graphs are obtained. We also give sharp upper and lower bounds of $SW_k$ of a connected graph, and establish some of its properties in the case of trees.

distance ; Steiner distance ; degree distance ; Steiner

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

78

2017.

221-230

objavljeno

0340-6253

Povezanost rada

nije evidentirano

Indeksiranost