Steiner Degree Distance of Two Graph Products
Steiner Degree Distance of Two Graph Products
复制标题
DOI：
10.2478/auom-2019-0020
复制
发表时间：
2019-06
期刊：
影响因子：
--
通讯作者：
Y. Mao;Zhao Wang;K. Das
中科院分区：
文献类型：
--
作者：
Y. Mao;Zhao Wang;K. Das
连通图G的度距离DD(G)是由Dobrynin和Kochetova于1994年提出的。最近，有作者引入了k中心施泰纳度距离的概念，定义为SDDk(G)=∑S≤V(G)|S|=k[∑V∈Sdeg∈G(V)]dG(S), SDD＿k (G)= \sum\limits ＿ {\mathop S{\subseteq V(G) }\limits ＿ {\left |S \right |=k }}{\left[ {\sum\limits_{v \in S} {{\it deg} _G (v)} } \right] d＿G }(S)，其中dG(S)为S的施泰纳k距离，degG(V)为G中顶点V的度数。研究了完全积图和笛卡尔积图的斯坦纳度距离。
Abstract The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈SdegG(v)]dG(S), SDD_k (G) = \sum\limits_{\mathop {S \subseteq V(G)}\limits_{\left| S \right| = k} } {\left[ {\sum\limits_{v \in S} {{\it deg} _G (v)} } \right]d_G (S),} where dG(S) is the Steiner k-distance of S and degG(v) is the degree of the vertex v in G. In this paper, we investigate the Steiner degree distance of complete and Cartesian product graphs.