Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Foster_graph> ?p ?o. }
Showing items 1 to 42 of
42
with 100 items per page.
- Foster_graph abstract "In the mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges.The Foster graph is Hamiltonian and has chromatic number 2, chromatic index 3, radius 8, diameter 8 and girth 10. It is also a 3-vertex-connected and 3-edge-connected graph.All the cubic distance-regular graphs are known. The Foster graph is one of the 13 such graphs. It is the unique distance-transitive graph with intersection array {3,2,2,2,2,1,1,1;1,1,1,1,2,2,2,3}. It can be constructed as the incidence graph of the partial linear space which is the unique triple cover with no 8-gons of the generalized quadrangle GQ(2,2). It is named after R. M. Foster, whose Foster census of cubic symmetric graphs included this graph.".
- Foster_graph thumbnail Foster_graph.svg?width=300.
- Foster_graph wikiPageID "11197065".
- Foster_graph wikiPageRevisionID "544798290".
- Foster_graph automorphisms "4320".
- Foster_graph chromaticIndex "3".
- Foster_graph chromaticNumber "2".
- Foster_graph diameter "8".
- Foster_graph edges "135".
- Foster_graph girth "10".
- Foster_graph hasPhotoCollection Foster_graph.
- Foster_graph imageCaption "The Foster graph".
- Foster_graph name "Foster graph".
- Foster_graph namesake R._M._Foster.
- Foster_graph properties Bipartite_graph.
- Foster_graph properties Cubic_graph.
- Foster_graph properties Distance-transitive_graph.
- Foster_graph properties Hamiltonian_path.
- Foster_graph properties Symmetric_graph.
- Foster_graph radius "8".
- Foster_graph vertices "90".
- Foster_graph subject Category:Individual_graphs.
- Foster_graph subject Category:Regular_graphs.
- Foster_graph type Abstraction100002137.
- Foster_graph type Communication100033020.
- Foster_graph type Graph107000195.
- Foster_graph type IndividualGraphs.
- Foster_graph type RegularGraphs.
- Foster_graph type VisualCommunication106873252.
- Foster_graph comment "In the mathematical field of graph theory, the Foster graph is a bipartite 3-regular graph with 90 vertices and 135 edges.The Foster graph is Hamiltonian and has chromatic number 2, chromatic index 3, radius 8, diameter 8 and girth 10. It is also a 3-vertex-connected and 3-edge-connected graph.All the cubic distance-regular graphs are known. The Foster graph is one of the 13 such graphs. It is the unique distance-transitive graph with intersection array {3,2,2,2,2,1,1,1;1,1,1,1,2,2,2,3}.".
- Foster_graph label "Foster graph".
- Foster_graph label "Grafo de Foster".
- Foster_graph label "Graphe de Foster".
- Foster_graph sameAs Graphe_de_Foster.
- Foster_graph sameAs Grafo_de_Foster.
- Foster_graph sameAs m.02r3bm3.
- Foster_graph sameAs Q3115485.
- Foster_graph sameAs Q3115485.
- Foster_graph sameAs Foster_graph.
- Foster_graph wasDerivedFrom Foster_graph?oldid=544798290.
- Foster_graph depiction Foster_graph.svg.
- Foster_graph isPrimaryTopicOf Foster_graph.
