About: K-vertex-connected graph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Graph with more than k vertices that cannot be disconnected by the deletion of fewer than k vertices

thumbnail
Property Value
dbo:description
  • Graph, der mehr als k Knoten hat und zusammenhängend bleibt, wenn weniger als k Knoten entfernt werden (de)
  • olyan gráf, melyben található út bármely két csúcs között még tetszőleges k‒1 csúcs elhagyása után is (hu)
  • граф, который имеет больше чем k вершин и после удаления менее чем k любых вершин граф остаётся связным (ru)
  • graph with more than k vertices that cannot be disconnected by the deletion of fewer than k vertices (en)
  • graf care nu poate fi deconectat prin ștergerea a mai puțin de k noduri (ro)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • K-vertex-connected graph (en)
  • K-Zusammenhang (de)
  • Graphe sommet-connexe (fr)
  • K-頂点連結グラフ (ja)
  • Graf k-spójny (pl)
  • Вершинно k-связный граф (ru)
  • Grafo k-vértice-conexo (pt)
  • K-вершинно-зв'язний граф (uk)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:properties 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