环身贾

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Spanning Trees in a Class of Five Regular Small World Network	2017	环身贾
+	Spanning Trees in a Class of Four Regular Small World Network	2014	环身贾

Common Coauthors

Coauthor	Papers Together

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Random Walks on Complex Networks	2004	Jae Dong Noh Heiko Rieger	2
+ PDF Chat	Spanning Trees on the Sierpinski Gasket	2007	Shu-Chiuan Chang Lung‐Chi Chen Wei-Shih Yang	2
+	New method for counting the number of spanning trees in a two-tree network	2013	Yuzhi Xiao Haixing Zhao	2
+ PDF Chat	Synchronization is optimal in nondiagonalizable networks	2006	Takashi Nishikawa Adilson E. Motter	2
+ PDF Chat	A New Class of the Planar Networks with High Clustering and High Entropy	2013	Guona Hu Yuzhi Xiao Huanshen Jia Haixing Zhao	2
+ PDF Chat	Distribution of sizes of erased loops for loop-erased random walks	1997	Deepak Dhar Abhishek Dhar	2
+	On unreliability polynomials and graph connectivity in reliable network synthesis	1986	F Boesch	2
+ PDF Chat	Enumeration of spanning trees in a pseudofractal scale-free web	2010	Zhongzhi Zhang Hongxiao Liu Bin Wu Shuigeng Zhou	2
+ PDF Chat	Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component	2008	Russell Lyons Ron Peled Oded Schramm	1
+ PDF Chat	Random walks on weighted networks	2013	Zhongzhi Zhang Tong Shan Guanrong Chen	1
+	Spanning Trees in a Class of Four Regular Small World Network	2014	环身贾	1
+	Number of spanning trees on a lattice	1977	F Y Wu	1
+ PDF Chat	Mapping Koch curves into scale-free small-world networks	2010	Zhongzhi Zhang Shuyang Gao Lichao Chen Shuigeng Zhou Hongjuan Zhang Jihong Guan	1
+ PDF Chat	Counting spanning trees in self-similar networks by evaluating determinants	2011	Lin Yuan Bin Wu Zhongzhi Zhang Guanrong Chen	1
+ PDF Chat	Counting spanning trees in a small-world Farey graph	2012	Zhongzhi Zhang Bin Wu Lin Yuan	1