Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Regular_graph> ?p ?o. }
Showing items 1 to 45 of
45
with 100 items per page.
- Regular_graph abstract "In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other. A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k.Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of disconnected cycles and infinite chains.A 3-regular graph is known as a cubic graph.A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices.The complete graph is strongly regular for any .A theorem by Nash-Williams says that every k‑regular graph on 2k + 1 vertices has a Hamiltonian cycle.".
- Regular_graph wikiPageExternalLink reggraphs.html.
- Regular_graph wikiPageID "85821".
- Regular_graph wikiPageRevisionID "575073978".
- Regular_graph hasPhotoCollection Regular_graph.
- Regular_graph title "Regular Graph".
- Regular_graph title "Strongly Regular Graph".
- Regular_graph urlname "RegularGraph".
- Regular_graph urlname "StronglyRegularGraph".
- Regular_graph subject Category:Graph_families.
- Regular_graph subject Category:Regular_graphs.
- Regular_graph type Abstraction100002137.
- Regular_graph type Family108078020.
- Regular_graph type GraphFamilies.
- Regular_graph type Group100031264.
- Regular_graph type Organization108008335.
- Regular_graph type SocialGroup107950920.
- Regular_graph type Unit108189659.
- Regular_graph type YagoLegalActor.
- Regular_graph type YagoLegalActorGeo.
- Regular_graph type YagoPermanentlyLocatedEntity.
- Regular_graph comment "In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other.".
- Regular_graph label "Graf regularny".
- Regular_graph label "Grafo regular".
- Regular_graph label "Grafo regular".
- Regular_graph label "Graphe régulier".
- Regular_graph label "Regular graph".
- Regular_graph label "Regulärer Graph".
- Regular_graph label "Регулярный граф".
- Regular_graph label "正則グラフ".
- Regular_graph label "正則圖".
- Regular_graph sameAs Regulární_graf.
- Regular_graph sameAs Regulärer_Graph.
- Regular_graph sameAs Grafo_regular.
- Regular_graph sameAs Graphe_régulier.
- Regular_graph sameAs 正則グラフ.
- Regular_graph sameAs 정규_그래프.
- Regular_graph sameAs Graf_regularny.
- Regular_graph sameAs Grafo_regular.
- Regular_graph sameAs m.0lrt9.
- Regular_graph sameAs Q826467.
- Regular_graph sameAs Q826467.
- Regular_graph sameAs Regular_graph.
- Regular_graph wasDerivedFrom Regular_graph?oldid=575073978.
- Regular_graph isPrimaryTopicOf Regular_graph.