Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17005048> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q17005048 subject Q8498915.
- Q17005048 abstract "In graph theory, the bipartite half of a bipartite graph G = (U,V,E) is a graph whose vertex set is one of the two sides of the bipartition (without loss of generality, U) and in which there is an edge uiuj for each two vertices ui and uj in U that are at distance two from each other in G. That is, in a more compact notation, the bipartite half is G2[U] where the superscript 2 denotes the square of a graph and the square brackets denote an induced subgraph.For instance, the bipartite half of the complete bipartite graph Kn,n is the complete graph Kn and the bipartite half of the hypercube graph is the halved cube graph.When G is a distance-regular graph, its two bipartite halves are both distance-regular.".
- Q17005048 thumbnail Demi-4-cube.svg?width=300.
- Q17005048 wikiPageWikiLink Q13077214.
- Q17005048 wikiPageWikiLink Q131476.
- Q17005048 wikiPageWikiLink Q162252.
- Q17005048 wikiPageWikiLink Q174733.
- Q17005048 wikiPageWikiLink Q3115556.
- Q17005048 wikiPageWikiLink Q45715.
- Q17005048 wikiPageWikiLink Q4915409.
- Q17005048 wikiPageWikiLink Q5597091.
- Q17005048 wikiPageWikiLink Q8498915.
- Q17005048 wikiPageWikiLink Q913598.
- Q17005048 wikiPageWikiLink Q958394.
- Q17005048 comment "In graph theory, the bipartite half of a bipartite graph G = (U,V,E) is a graph whose vertex set is one of the two sides of the bipartition (without loss of generality, U) and in which there is an edge uiuj for each two vertices ui and uj in U that are at distance two from each other in G.".
- Q17005048 label "Bipartite half".
- Q17005048 depiction Demi-4-cube.svg.