Several Topological Indices of Two Kinds of Tetrahedral Networks

Tetrahedral network is considered as an effective tool to create the finite element network model of simulation, and many research studies have been investigated. The aim of this paper is to calculate several topological indices of the linear and circle tetrahedral networks. Firstly, the resistance distances of the linear tetrahedral network under different classifications have been calculated. Secondly, according to the above results, two kinds of degree-Kirchhoff indices of the linear tetrahedral network have been achieved. Finally, the exact expressions of Kemeny’s constant, Randic index, and Zagreb index of the linear tetrahedral network have been deduced. By using the same method, the topological indices of circle tetrahedral network have also been obtained.

[1]  Xudong Jiang,et al.  First Arrival Time Identification Using Transfer Learning With Continuous Wavelet Transform Feature Images , 2020, IEEE Geoscience and Remote Sensing Letters.

[2]  M. Randic,et al.  Resistance distance , 1993 .

[3]  Juan Rada,et al.  Trees with maximum exponential Randić index , 2020, Discret. Appl. Math..

[4]  Fuji Zhang,et al.  Resistance distance and the normalized Laplacian spectrum , 2007, Discret. Appl. Math..

[5]  Yongtang Shi,et al.  Note on two generalizations of the Randić index , 2015, Appl. Math. Comput..

[6]  Ante Graovac,et al.  Augmented Zagreb index , 2010 .

[7]  Yue Li,et al.  First arrival time picking for microseismic data based on DWSW algorithm , 2018, Journal of Seismology.

[8]  Piet Van Mieghem,et al.  Kemeny's constant and the effective graph resistance☆ , 2017 .

[9]  Shin Min Kang,et al.  M-polynomials and topological indices of hex-derived networks , 2018, Open Physics.

[10]  Robert E. Kooij,et al.  Kemeny's constant for several families of graphs and real-world networks , 2020, Discret. Appl. Math..

[11]  Shaohui Wang,et al.  Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs , 2019 .

[12]  Wei Gao,et al.  The Edge Versions of Degree-Based Topological Descriptors of Dendrimers , 2019, Journal of Cluster Science.

[13]  Xiang-Feng Pan,et al.  Computation of resistance distance and Kirchhoff index of the two classes of silicate networks , 2020, Appl. Math. Comput..

[14]  Impatient Random Walk , 2017, Journal of Theoretical Probability.

[15]  Zheng Xie,et al.  Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star , 2020, Appl. Math. Comput..

[16]  Alexander Schnurr.  On Deterministic Markov Processes: Expandability and Related Topics , 2011, 1111.1912.

[17]  Guihai Yu,et al.  Degree resistance distance of unicyclic graphs , 2012 .

[18]  A. Kyprianou,et al.  Conditioning subordinators embedded in Markov processes , 2015, 1506.07870.

[19]  Nikhil Srivastava,et al.  Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..

[20]  William J. J. Roberts,et al.  An EM Algorithm for Markov Modulated Markov Processes , 2009, IEEE Transactions on Signal Processing.

[22]  Franciszek Grabski,et al.  Semi-Markov failure rates processes , 2011, Appl. Math. Comput..

[23]  R. van der Hofstad,et al.  Random walk on barely supercritical branching random walk , 2018, Probability Theory and Related Fields.