Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Robertson_graph> ?p ?o. }
Showing items 1 to 37 of
37
with 100 items per page.
- Robertson_graph abstract "In the mathematical field of graph theory, the Robertson graph or (4,5)-cage, is a 4-regular undirected graph with 19 vertices and 38 edges named after Neil Robertson.The Robertson graph is the unique (4,5)-cage graph and was discovered by Robertson in 1964. As a cage graph, it is the smallest 4-regular graph with girth 5.It has chromatic number 3, chromatic index 5, diameter 3, radius 3 and is both 4-vertex-connected and 4-edge-connected. The Robertson graph is also a Hamiltonian graph which possesses 5,376 distinct directed Hamiltonian cycles.".
- Robertson_graph thumbnail Robertson_graph_hamiltonian.svg?width=300.
- Robertson_graph wikiPageID "24107869".
- Robertson_graph wikiPageRevisionID "545709837".
- Robertson_graph automorphisms "24".
- Robertson_graph chromaticIndex "5".
- Robertson_graph chromaticNumber "3".
- Robertson_graph diameter "3".
- Robertson_graph edges "38".
- Robertson_graph girth "5".
- Robertson_graph hasPhotoCollection Robertson_graph.
- Robertson_graph imageCaption "The Robertson graph is Hamiltonian.".
- Robertson_graph name "Robertson graph".
- Robertson_graph namesake Neil_Robertson_(mathematician).
- Robertson_graph properties Cage_(graph_theory).
- Robertson_graph properties Hamiltonian_path.
- Robertson_graph radius "3".
- Robertson_graph vertices "19".
- Robertson_graph subject Category:Individual_graphs.
- Robertson_graph subject Category:Regular_graphs.
- Robertson_graph type Abstraction100002137.
- Robertson_graph type Communication100033020.
- Robertson_graph type Graph107000195.
- Robertson_graph type IndividualGraphs.
- Robertson_graph type RegularGraphs.
- Robertson_graph type VisualCommunication106873252.
- Robertson_graph comment "In the mathematical field of graph theory, the Robertson graph or (4,5)-cage, is a 4-regular undirected graph with 19 vertices and 38 edges named after Neil Robertson.The Robertson graph is the unique (4,5)-cage graph and was discovered by Robertson in 1964. As a cage graph, it is the smallest 4-regular graph with girth 5.It has chromatic number 3, chromatic index 5, diameter 3, radius 3 and is both 4-vertex-connected and 4-edge-connected.".
- Robertson_graph label "Graphe de Robertson".
- Robertson_graph label "Robertson graph".
- Robertson_graph sameAs Graphe_de_Robertson.
- Robertson_graph sameAs m.07k4vsj.
- Robertson_graph sameAs Q3115531.
- Robertson_graph sameAs Q3115531.
- Robertson_graph sameAs Robertson_graph.
- Robertson_graph wasDerivedFrom Robertson_graph?oldid=545709837.
- Robertson_graph depiction Robertson_graph_hamiltonian.svg.
- Robertson_graph isPrimaryTopicOf Robertson_graph.
