CAJ | 학술논문

一个连通图G的Wiener数(或Wiener指标)定义为G中所有(无序)顶点对的距离之和，给出了n阶哈林图中Wiener数的最小值和对应的极图；以及直径为3的树所对应的哈林图的Wiener数的最小值和最大值，并确定了相应的极图；最后，给出了哈林图Wiener数的一个不等式。
일개련통도G적Wiener수(혹Wiener지표)정의위G중소유(무서)정점대적거리지화，급출료n계합림도중Wiener수적최소치화대응적겁도；이급직경위3적수소대응적합림도적Wiener수적최소치화최대치，병학정료상응적겁도；최후，급출료합림도Wiener수적일개불등식。
A connected graph G Wiener number (or Wiener) is defined as the G in all (disorder) vertex and distance. The pole figure of minimum values and the corresponding gives Wiener n order Halin graphs number;number and diameter of 3 Wiener corresponding to the tree Halin graphs of minimum and the maximum value, and determine the corresponding extreme graphs;finally, gives an inequality of Halin graphs of Wiener numbers.