Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Shrikhande_graph> ?p ?o. }
Showing items 1 to 44 of
44
with 100 items per page.
- Shrikhande_graph abstract "In the mathematical field of graph theory, the Shrikhande graph is a named graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having a degree of 6. Every pair of nodes has exactly two other neighbors in common, whether the pair of nodes is connected or not.".
- Shrikhande_graph thumbnail Shrikhande_graph_square.svg?width=300.
- Shrikhande_graph wikiPageExternalLink the-shrikhande-graph.
- Shrikhande_graph wikiPageID "13672415".
- Shrikhande_graph wikiPageRevisionID "602310823".
- Shrikhande_graph automorphisms "192".
- Shrikhande_graph chromaticIndex "6".
- Shrikhande_graph chromaticNumber "4".
- Shrikhande_graph diameter "2".
- Shrikhande_graph edges "48".
- Shrikhande_graph girth "3".
- Shrikhande_graph hasPhotoCollection Shrikhande_graph.
- Shrikhande_graph imageCaption "The Shrikhande graph".
- Shrikhande_graph name "Shrikhande graph".
- Shrikhande_graph namesake Sharadchandra_Shankar_Shrikhande.
- Shrikhande_graph properties Eulerian_path.
- Shrikhande_graph properties Hamiltonian_path.
- Shrikhande_graph properties Integral_graph.
- Shrikhande_graph properties Strongly_regular_graph.
- Shrikhande_graph properties Symmetric_graph.
- Shrikhande_graph radius "2".
- Shrikhande_graph vertices "16".
- Shrikhande_graph subject Category:4-chromatic_graphs.
- Shrikhande_graph subject Category:Individual_graphs.
- Shrikhande_graph subject Category:Regular_graphs.
- Shrikhande_graph type Abstraction100002137.
- Shrikhande_graph type Communication100033020.
- Shrikhande_graph type Graph107000195.
- Shrikhande_graph type IndividualGraphs.
- Shrikhande_graph type RegularGraphs.
- Shrikhande_graph type VisualCommunication106873252.
- Shrikhande_graph comment "In the mathematical field of graph theory, the Shrikhande graph is a named graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with 16 vertices and 48 edges, with each vertex having a degree of 6. Every pair of nodes has exactly two other neighbors in common, whether the pair of nodes is connected or not.".
- Shrikhande_graph label "Grafo de Shrikhande".
- Shrikhande_graph label "Graphe de Shrikhande".
- Shrikhande_graph label "Shrikhande graph".
- Shrikhande_graph sameAs Graphe_de_Shrikhande.
- Shrikhande_graph sameAs Grafo_de_Shrikhande.
- Shrikhande_graph sameAs m.03cdqm5.
- Shrikhande_graph sameAs Q3115537.
- Shrikhande_graph sameAs Q3115537.
- Shrikhande_graph sameAs Shrikhande_graph.
- Shrikhande_graph wasDerivedFrom Shrikhande_graph?oldid=602310823.
- Shrikhande_graph depiction Shrikhande_graph_square.svg.
- Shrikhande_graph isPrimaryTopicOf Shrikhande_graph.
