Connective Steiner 3-eccentricity index and network similarity measure

作者：

Highlights：

• The connective Steiner 3-eccntricity index of graphs based on the 3-eccnetricity was introduced firstly. Some mathematical properties of connective Steiner 3-eccntricity index were present.

• An O(n2)-polynomial time algorithm to compute the connective Steiner 3-eccntricity index of trees was developed.

• Network similarity measure based on the connective Steiner 3-eccntricity index was built. By numerical analysis, we analyzed its advantage.

摘要

•The connective Steiner 3-eccntricity index of graphs based on the 3-eccnetricity was introduced firstly. Some mathematical properties of connective Steiner 3-eccntricity index were present.•An O(n2)-polynomial time algorithm to compute the connective Steiner 3-eccntricity index of trees was developed.•Network similarity measure based on the connective Steiner 3-eccntricity index was built. By numerical analysis, we analyzed its advantage.

论文关键词：Steiner distance,Steiner k-eccentricity,Connective Steiner 3-eccentricity index

论文评审过程：Received 26 April 2020, Revised 1 June 2020, Accepted 7 June 2020, Available online 21 June 2020, Version of Record 21 June 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125446