TOPOLOGICAL CRYSTALS JOHN C. BAEZ Abstract. Sunada’s work on topological crystallography emphasizes the role of the ‘maximal abelian cover’ of a graph X. This is a covering space of X for which the group of deck tr

Source URL: math.ucr.edu

Contractibility and Self-Intersections of Curves on Surfaces David de Laat Bachelor Thesis in Mathematics

Source URL: www.daviddelaat.nl

• Topology
• Mathematics
• Space
• Geometric topology
• Surfaces
• Algebraic topology
• Topological graph theory
• Orientability
• Genus
• Differential geometry of surfaces
• Torus
• Covering space

Spectral Graph Theory Lecture 10 Random Walks on Graphs Daniel A. Spielman

Source URL: www.cs.yale.edu

• Graph theory
• Mathematics
• Stochastic processes
• Algebraic graph theory
• Laplacian matrix
• Matrices
• Random walk
• Graph
• Representation
• Differential topology
• Expander graph
• Covering graph

PDF Document

Source URL: www-cc.cs.uni-saarland.de

• Graph theory
• Mathematics
• Graph coloring
• Polytopes
• Incidence coloring
• Covering graph

1 Disk Covering Methods: improving the accuracy and speed of large-scale phylogenetic analyses 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 Phylogenetic ana

Source URL: web.engr.illinois.edu

• Graph theory
• Phylogenetics
• Computational phylogenetics
• Maximum parsimony
• Chordal graph
• Disk-covering method
• Phylogenetic tree
• Neighbor joining
• Tree
• Tree decomposition
• Minimum spanning tree

Spectral Graph Theory and Applications WSLecture 7: Hitting Time and Cover Time of Random Walks Lecturer: Thomas Sauerwald & He Sun

Source URL: resources.mpi-inf.mpg.de

• Graph theory
• Mathematics
• NP-complete problems
• Degree
• Algebraic graph theory
• Covering graph
• Line graph

JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386 Disk-Covering, a Fast-Converging Method

Source URL: web.engr.illinois.edu

• Graph theory
• Spanning tree
• Chordal graph
• Binary tree
• Tree
• Tree decomposition
• Planted motif search

Crystals That Nature Might Miss Creating Toshikazu Sunada N

Source URL: www.ams.org

• Crystallography
• Lattice
• Diamond cubic
• Laves graph
• Space group
• Covering graph
• Toshikazu Sunada
• Crystal structure
• Random walk
• Dipole graph
• Periodic graph

Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece

Source URL: emarkou.users.uth.gr

• Polygons
• NP-complete problems
• Computational problems
• Computational geometry
• Combinatorial optimization
• Art gallery problem
• Visibility graph
• Simple polygon
• Clique
• Cut
• Optimization problem
• Polygon covering

MIMS Technical Report No) Proceedings of Symposia in Pure Mathematics Discrete Geometric Analysis Toshikazu Sunada

Source URL: www.mims.meiji.ac.jp

• Graph theory
• Harmonic functions
• Fourier analysis
• Laplace operator
• Multivariable calculus
• Covering graph
• Graph
• Logarithm
• Discrete Laplace operator
• Differential forms on a Riemann surface