Applications of Laplacian spectrum for the vertex–vertex graph

Complex networks have attracted a great deal of attention from scientific communities, and have been proven as a useful tool to characterize the topologies and dynamics of real and human-made compl...

[1]  M. Dai,et al.  Coherence analysis of a class of weighted tree-like polymer networks , 2018 .

[2]  Xiaogang Liu,et al.  Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae , 2012, 1212.0851.

[3]  Zhongzhi Zhang,et al.  Exactly solvable tight-binding model on two scale-free networks with identical degree distribution , 2016, 1606.03825.

[4]  Ming Cao,et al.  Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks , 2017, Autom..

[5]  R. Andrade,et al.  Exact evaluation of the causal spectrum and localization properties of electronic states on a scale-free network , 2017, Physica A: Statistical Mechanics and its Applications.

[6]  Jixiang Meng,et al.  Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs , 2017, Appl. Math. Comput..

[7]  Zhongzhi Zhang,et al.  On the spectrum of the normalized Laplacian of iterated triangulations of graphs , 2015, Appl. Math. Comput..

[8]  Kinkar Chandra Das,et al.  On Laplacian energy in terms of graph invariants , 2015, Appl. Math. Comput..

[9]  A. Sinan Çevik,et al.  On the Laplacian-energy-like invariant , 2014 .

[10]  Sabato Manfredi,et al.  A decentralised topology control to regulate global properties of complex networks , 2017 .

[11]  M. Dai,et al.  Spectral analysis for weighted tree-like fractals , 2018 .

[12]  Art M. Duval,et al.  Simplicial matrix-tree theorems , 2008, 0802.2576.

[13]  Bing Yao,et al.  A class of vertex–edge-growth small-world network models having scale-free, self-similar and hierarchical characters , 2018 .

[14]  Joyati Debnath,et al.  An Innovative Combinatorial Approach for the Spanning Tree Entropy in Flower Network , 2017, NETYS.

[15]  J. Liu,et al.  Scaling of average receiving time and average weighted shortest path on weighted Koch networks , 2012 .

[16]  Xiaogang Liu,et al.  Spectral characterizations of propeller graphs , 2012, 1205.5943.

[17]  Andrés M. Encinas,et al.  A formula for the Kirchhoff index , 2008 .

[18]  Julio M. Ottino,et al.  Complex networks , 2004, Encyclopedia of Big Data.

[19]  Wei Yang,et al.  Random walk in orthogonal space to achieve efficient free-energy simulation of complex systems , 2008, Proceedings of the National Academy of Sciences.

[20]  Lastri Widya Astuti,et al.  PENGENALAN POLA SUARA MANUSIA BEREKSTENSI FILE WAV MENGGUNAKAN METODE FAST FOURIER TRANSFORM DAN BAYES , 2018 .

[21]  B. K. Sarma,et al.  The Spectrum of the Corona of Two Graphs , 2007, SIAM J. Discret. Math..

[22]  Ahmed M. A. El-Sayed,et al.  On the fractional differential equations , 1992 .

[23]  Weigang Sun,et al.  Laplacian spectrum of a family of recursive trees and its applications in network coherence , 2016 .

[24]  Hiroshi Inaba,et al.  Further analysis of the number of spanning trees in circulant graphs , 2006, Discret. Math..