An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Mathematical graph where most nodes can be reached by a small number of steps

Property Value
dbo:description
  • Mathematical graph where most nodes can be reached by a small number of steps (en)
  • tipo de grafo en matemática y física (es)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageInterLanguageLink
dbo:wikiPageWikiLink
dbp:caption
  • Average degree = 2.833 (en)
  • Average degree= 3.833 (en)
  • Average shortest path length = 1.803. (en)
  • Average shortest path length = 2.109. (en)
  • Clustering coefficient = 0.167 (en)
  • Clustering coefficient = 0.522 (en)
  • Random graph (en)
dbp:date
  • 2021-03-14 (xsd:date)
dbp:header
  • Hubs are bigger than other nodes (en)
  • Small-world network example (en)
dbp:image
  • Random graph gephi.png (en)
  • Small-world-network-example.png (en)
dbp:url
dbp:width
  • 130 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Small-world network (en)
  • شبكات العالم الصغير (ar)
  • Red de mundo pequeño (es)
  • Réseau « petit monde » (fr)
  • 작은 세상 네트워크 (ko)
  • Sieć Small-world (pl)
  • Redes de pequeno mundo (pt)
  • Мир тесен (граф) (ru)
  • Світ тісний (граф) (uk)
  • 小世界網路 (zh)
rdfs:seeAlso
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International