Chung, Fan R. K., 1949-
Chung, Fan R.K.
金芳蓉
Chung, Fan Rong King, 1949-....
Chung Graham, Fan 1949-
Chung, Fan Rong K. 1949-....
צ'ונג גרהאם, פאן, 1949-
Chung, Fan, 1949-
VIAF ID: 36098917 (Personal)
Permalink: http://viaf.org/viaf/36098917
Preferred Forms
-
100 1 _ ‡a Chung Graham, Fan ‡d 1949-
-
200 _ | ‡a Chung ‡b Fan Rong K. ‡f 1949-....
-
100 1 _ ‡a Chung, Fan R. K.
-
-
-
-
-
100 1 _ ‡a Chung, Fan R. K., ‡d 1949-
-
-
-
-
100 1 _ ‡a Chung, Fan R.K.
-
100 1 _ ‡a Chung, Fan Rong King, ‡d 1949-....
-
-
-
100 0 _ ‡a 金芳蓉
4xx's: Alternate Name Forms (41)
5xx's: Related Names (5)
- 510 2 _
‡a
CBMS Conference on Recent Advances in Spectral Graph Theory (1994 ; Fresno)
- 510 2 _
‡a
CBMS regional conference on the combinatorics of large sparse graphs 2004
- 510 2 _
‡a
Conference Board of the Mathematical Sciences
- 510 2 _
‡a
University of California, San Diego
- 510 2 _
‡a
University of California, San Diego
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
Works
Title | Sources |
---|---|
50 years of combinatorics, graph theory, and computing |
![]() ![]() |
Algorithms and Models for the Web Graph : 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016, Proceedings |
![]() |
Applications of discrete mathematics : [proceedings of the Third Conference on Discrete Mathematics, Clemson University, Clemson, South Carolina, May 14-16, 1986] |
![]() |
The average distances in random graphs with given expected degrees |
![]() |
Complex graphs and networks |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Duplication models for biological networks. |
![]() |
A Dynamic location problem for graphs |
![]() |
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design |
![]() |
Erdős on graphs his legacy of unsolved problems [dedicated to Paul Erdös] |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Extremal subgraphs for two graphs |
![]() |
Forced Convex n -Gons in the Plane |
![]() |
Forest formulas of discrete Green's functions |
![]() |
The forwarding index of communication networks |
![]() |
The heat kernel as the pagerank of a graph |
![]() |
Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs |
![]() |
Highly irregular graphs |
![]() |
Internet and Network Economics : Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings |
![]() |
Laplacian and Vibrational Spectra for Homogeneous Graphs |
![]() |
Laplacians of graphs and hypergraphs |
![]() |
Mathematical modeling with Excel |
![]() |
Minimal decompositions of two graphs into pairwise isomorphic subgraphs |
![]() |
A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES |
![]() |
A Note on Finding a Strict Saddlepoint |
![]() |
The Number of Different Distances Determined by a Set of Points in the Euclidean Plane |
![]() |
Oblivious and Adaptive Strategies for the Majority and Plurality Problems |
![]() |
On graphs which contain all sparse graphs |
![]() |
On irregularities of distribution of real sequences |
![]() |
On sampling with Markov chains |
![]() |
On the bandwidths of a graph and its complement |
![]() |
On the cover polynomial of a digraph |
![]() |
PageRank and Random Walks on Graphs |
![]() |
Pebbling a Chessboard |
![]() |
Pebbling in Hypercubes |
![]() |
Primitive Juggling Sequences |
![]() |
Probabilistic combinatorics and its applications, 1992: |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Quantitative forms of a theorem of Hilbert |
![]() |
Quasi-random set systems |
![]() |
Quasi-random tournaments |
![]() |
Random Walks Arising in Random Number Generation |
![]() |
Separator theorems and their applications |
![]() |
Some intersection theorems for ordered sets and graphs |
![]() |
Sparse Quasi-Random Graphs |
![]() |
Spectral graph theory |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Spectral grouping using the Nyström method |
![]() |
Theory of computing : selected papers |
![]() |
Universal cycles for combinatorial structures |
![]() |
Universal Graphs for Bounded-Degree Trees and Planar Graphs |
![]() |
The workshop on internet topology (wit) report |
![]() |