toroidal graph

  • 1Toroidal graph — [ A graph (similar to the Heawood graph) embedded on the torus such that no edges cross. ] In mathematics, a graph G is toroidal if it can be embedded on the torus. In other words, the graph s vertices can be placed on a torus such that no edges… …

    Wikipedia

  • 2Toroidal — may refer to:*Toroidal inductors and transformers, a type of electrical device *Toroid, a doughnut shaped object whose surface is a torus *Toroidal and poloidal, directions in magnetohydrodynamics *Toroidal coordinates, a three dimensional… …

    Wikipedia

  • 3Graphe toroïdal — Un graphe plongé sur le tore de telle façon que les arêtes ne se coupent pas. En mathématiques, et plus précisément en théorie des graphes , un graphe G est toroïdal s il peut être plongé sur le tore, c et à dire que les sommets du graphe peuvent …

    Wikipédia en Français

  • 4Dyck graph — The Dyck graph Named after W. Dyck Vertices 32 Edges …

    Wikipedia

  • 5Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 …

    Wikipedia

  • 6Heawood graph — infobox graph name = Heawood graph image caption = namesake = Percy John Heawood vertices = 14 edges = 21 girth = 6 chromatic number = 2 chromatic index = 3 properties = Cubic Cage Distance regular ToroidalIn the mathematical field of graph… …

    Wikipedia

  • 7Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 …

    Wikipedia

  • 8Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …

    Wikipedia

  • 9Topological graph theory — In mathematics topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, and graphs as topological spaces. [J.L. Gross and T.W. Tucker, Topological graph theory, Wiley Interscience, 1987] Embedding a… …

    Wikipedia

  • 10Shrikhande graph — infobox graph name = Shrikhande graph image caption = The Shrikhande graph drawn symmetrically. namesake = S. S. Shrikhande vertices = 16 edges = 48 chromatic number = chromatic index = properties = Strongly regularThe Shrikhande graph is a named …

    Wikipedia