• Log in
  • Main Page
  • Community portal
  • Current events
  • Recent changes
  • Random page
  • Help

Category:The Degree/Diameter Problem

From Combinatorics Wiki

Jump to: navigation, search

The main page for this category is The Degree/Diameter Problem.

Moderators for this category are: Eyal Loz, Hebert Pérez-Rosés, and Guillermo Pineda-Villavicencio.

Pages in category "The Degree/Diameter Problem"

The following 11 pages are in this category, out of 11 total.

D

  • Description of optimal Cayley graphs found by Marston Conder

T

  • The Degree Diameter Problem for Arc Transitive Graphs
  • The Degree Diameter Problem for Bipartite Graphs

T cont.

  • The Degree Diameter Problem for Cayley Graphs
  • The Degree Diameter Problem for General Digraphs
  • The Degree Diameter Problem for General Graphs
  • The Degree Diameter Problem for Planar Graphs

T cont.

  • The Degree Diameter Problem for Vertex Symmetric Digraphs
  • The Degree Diameter Problem for Vertex Transitive Graphs
  • The Degree/Diameter Problem
  • The Degree/Diameter Problem for Several Classes of Graphs Project
Retrieved from "http://combinatoricswiki.org/wiki/Category:The_Degree/Diameter_Problem"
  • Category |
  • Discussion |
  • View source |
  • History
This page was last modified on 16 January 2009, at 23:21. This page has been accessed 1,141 times.
  • Disclaimers |
  • Powered by MediaWiki |
  • Content is available under GNU Free Documentation License.