Jun Yin

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Classes of uniformly most reliable graphs for all-terminal reliability 2019 Kassie Archer
Christina Graves
David Milan
4
+ The Complexity of Enumeration and Reliability Problems 1979 Leslie G. Valiant
3
+ Two path extremal graphs and an application to a Ramsey-type problem 1999 Owen Byer
3
+ Building uniformly most-reliable networks by iterative augmentation 2017 Pablo Romero
3
+ Long cycles through specified vertices in a graph 1989 Akira Saito
2
+ PDF Chat The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs 2013 Francesc Comellas
AlĂ­cia Miralles
Hongxiao Liu
Zhongzhi Zhang
2
+ PDF Chat Spanning Trees on the Sierpinski Gasket 2007 Shu-Chiuan Chang
Lung‐Chi Chen
Wei-Shih Yang
2
+ PDF Chat Enumeration of spanning trees in a pseudofractal scale-free web 2010 Zhongzhi Zhang
Hongxiao Liu
Bin Wu
Shuigeng Zhou
2
+ 2‐neighborhoods and hamiltonian conditions 1992 Ronghua Shi
2
+ PDF Chat An ensemble of random graphs with identical degree distribution 2020 Fei Ma
Xiaomin Wang
Ping Wang
2
+ The number of spanning trees of a family of 2-separable weighted graphs 2017 Helin Gong
Shuli Li
2
+ On graphs with randomly deleted edges 1981 Alexander Kelmans
2
+ PDF Chat Transport in Weighted Networks: Partition into Superhighways and Roads 2006 Zhenhua Wu
Lidia A. Braunstein
Shlomo Havlin
H. Eugene Stanley
2
+ Cycles through specified vertices 1993 BĂ©la BollobĂĄs
Graham Brightwell
2
+ Enumeration of spanning trees of 2-separable networks 2019 Tianyu Li
Weigen Yan
2
+ PDF Chat Counting spanning trees in a small-world Farey graph 2012 Zhongzhi Zhang
Bin Wu
Lin Yuan
2
+ On the number of spanning trees on various lattices 2010 Elmar Teufl
Stephan Wagner
2
+ PDF Chat Cycles through specified vertices in triangle-free graphs 2007 Daniël Paulusma
Kiyoshi Yoshimoto
2
+ PDF Chat Synchronization is optimal in nondiagonalizable networks 2006 Takashi Nishikawa
Adilson E. Motter
1
+ PDF Chat Spanning trees on graphs and lattices in<i>d</i>dimensions 2000 Robert Shrock
F. Y. Wu
1
+ PDF Chat On Eulerian and Hamiltonian Graphs and Line Graphs 1965 Frank Harary
C. St. J. A. Nash‐Williams
1
+ PDF Chat Counting spanning trees in self-similar networks by evaluating determinants 2011 Lin Yuan
Bin Wu
Zhongzhi Zhang
Guanrong Chen
1
+ Forbidden subgraphs that imply 2-factors 2007 Jill R. Faudree
Ralph J. Faudree
Zdeněk Ryjáček
1
+ Counting Minimum Weight Spanning Trees 1997 Andrei Broder
Ernst Mayr
1
+ Enumeration of spanning trees of graphs with rotational symmetry 2011 Weigen Yan
Fuji Zhang
1
+ Enumerating spanning trees of graphs with an involution 2008 Fuji Zhang
Weigen Yan
1
+ PDF Chat Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances 1993 Robert Burton
Robin Pemantle
1
+ PDF Chat Distribution of sizes of erased loops for loop-erased random walks 1997 Deepak Dhar
Abhishek Dhar
1
+ Steiner centers in graphs 1990 Ortrud R. Oellermann
Songlin Tian
1
+ All but 49 Numbers are Wiener Indices of Trees 2006 Hua Wang
Guang Yu
1
+ Resistance Scaling and the Number of Spanning Trees in Self-Similar Lattices 2011 Elmar Teufl
Stephan Wagner
1
+ The average Steiner distance of a graph 1996 Peter Dankelmann
Ortrud R. Oellermann
Henda C. Swart
1
+ PDF Chat Asymptotic Enumeration of Spanning Trees 2005 Russell Lyons
1
+ PDF Chat Modeling the multi-layer nature of the European Air Transport Network: Resilience and passengers re-scheduling under random failures 2013 Alessio Cardillo
Massimiliano Zanin
JesĂșs GĂłmez‐Gardeñes
Miguel Romance
Alejandro J. GarcĂ­a del Amo
Stefano Boccaletti
1
+ A proof of Boesch's conjecture 1994 Guifang Wang
1
+ Forbidden subgraphs for longest cycles to contain vertices with large degrees 2014 Binlong Li
Shenggui Zhang
1
+ A note on Hamiltonian circuits 1972 VaĆĄek ChvĂĄtal
P. ErdƑs
1
+ Cycles in Graphs with Prescribed Stability Number and Connectivity 1994 Mekkia Kouider
1
+ Upper bounds on the Steiner diameter of a graph 2012 Patrick Ali
Peter Dankelmann
Simon Mukwembi
1
+ Some remarks on inverse Wiener index problem 2012 Jiƙí Fink
Borut LuĆŸar
Riste Ć krekovski
1
+ Longest cycles in k-connected graphs with given independence number 2011 O Suil
Douglas B. West
Hehui Wu
1
+ PDF Chat Multicenter Wiener indices and their applications 2015 IvĂĄn Gutman
Boris Furtula
Xueliang Li
1
+ Line Graphs and Forbidden Induced Subgraphs 2001 Hong‐Jian Lai
ÄœubomĂ­r Ć oltĂ©s
1
+ PDF Chat Molecular graphs and the inverse Wiener index problem 2008 Stephan Wagner
Hua Wang
Gang Yu
1
+ The Number of Spanning Trees in Self-Similar Graphs 2011 Elmar Teufl
Stephan Wagner
1
+ The number of spanning trees in Apollonian networks 2014 Zhongzhi Zhang
Bin Wu
Francesc Comellas
1
+ None 2010 1
+ PDF Chat Percolation in hierarchical scale-free nets 2007 HernĂĄn D. Rozenfeld
Daniel ben‐Avraham
1
+ A Note on the Inverse Problem for the Wiener Index 2010 Stephan Wagner
1
+ PDF Chat Steiner distance in graphs 1989 Gary Chartrand
Ortrud R. Oellermann
Song Lin Tian
Hung Bin Zou
1