Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3034779> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q3034779 subject Q8546843.
- Q3034779 subject Q8647012.
- Q3034779 abstract "In the mathematical field of graph theory, the Biggs–Smith graph is a 3-regular graph with 102 vertices and 153 edges.It has chromatic number 3, chromatic index 3, radius 7, diameter 7 and girth 9. It is also a 3-vertex-connected graph and a 3-edge-connected graph.All the cubic distance-regular graphs are known. The Biggs–Smith graph is one of the 13 such graphs.".
- Q3034779 thumbnail Biggs-Smith_graph.svg?width=300.
- Q3034779 wikiPageWikiLink Q1050972.
- Q3034779 wikiPageWikiLink Q1205074.
- Q3034779 wikiPageWikiLink Q131476.
- Q3034779 wikiPageWikiLink Q1374495.
- Q3034779 wikiPageWikiLink Q273037.
- Q3034779 wikiPageWikiLink Q2997419.
- Q3034779 wikiPageWikiLink Q3034655.
- Q3034779 wikiPageWikiLink Q3115556.
- Q3034779 wikiPageWikiLink Q3115621.
- Q3034779 wikiPageWikiLink Q3180727.
- Q3034779 wikiPageWikiLink Q395.
- Q3034779 wikiPageWikiLink Q504843.
- Q3034779 wikiPageWikiLink Q727035.
- Q3034779 wikiPageWikiLink Q826467.
- Q3034779 wikiPageWikiLink Q849705.
- Q3034779 wikiPageWikiLink Q8546843.
- Q3034779 wikiPageWikiLink Q8647012.
- Q3034779 comment "In the mathematical field of graph theory, the Biggs–Smith graph is a 3-regular graph with 102 vertices and 153 edges.It has chromatic number 3, chromatic index 3, radius 7, diameter 7 and girth 9. It is also a 3-vertex-connected graph and a 3-edge-connected graph.All the cubic distance-regular graphs are known. The Biggs–Smith graph is one of the 13 such graphs.".
- Q3034779 label "Biggs–Smith graph".
- Q3034779 depiction Biggs-Smith_graph.svg.