Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Graph connectivity
An Entity of Type:
Concept
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Property
Value
dbo:
wikiPageID
25113396
(xsd:integer)
dbo:
wikiPageRevisionID
545779698
(xsd:integer)
dbp:
wikiPageUsesTemplate
dbt
:Cat_main
rdf:
type
skos
:Concept
rdfs:
label
Graph connectivity
(en)
skos:
broader
dbc
:Graph_invariants
dbc
:Graph_theory
dbc
:Network_analysis
skos:
prefLabel
Graph connectivity
(en)
prov:
wasDerivedFrom
wikipedia-en
:Category:Graph_connectivity?oldid=545779698&ns=14
is
dbo:
wikiPageWikiLink
of
dbr
:Menger's_theorem
dbr
:Biconnected_component
dbr
:Algebraic_connectivity
dbr
:Cycle_rank
dbr
:Vertex_separator
dbr
:Weak_component
dbr
:Connectivity_(graph_theory)
dbr
:Connected_dominating_set
dbr
:Component_(graph_theory)
dbr
:Path_(graph_theory)
dbr
:Gammoid
dbr
:K-edge-connected_graph
dbr
:K-vertex-connected_graph
dbr
:Karger's_algorithm
dbr
:Cut_(graph_theory)
dbr
:Balinski's_theorem
dbr
:Bridge_(graph_theory)
dbr
:Graph_toughness
dbr
:Graphic_matroid
dbr
:Pixel_connectivity
dbr
:Strongly_connected_component
dbr
:Structural_cohesion
dbr
:Rank_(graph_theory)
dbr
:Reachability
dbr
:Biconnected_graph
dbr
:Tarjan's_strongly_connected_components_algorithm
dbr
:St-connectivity
dbr
:Kosaraju's_algorithm
dbr
:SPQR_tree
dbr
:Strong_orientation
dbr
:Path-based_strong_component_algorithm
dbr
:Giant_component
dbr
:Robbins'_theorem
dbr
:Strength_of_a_graph
dbr
:Stoer–Wagner_algorithm
dbr
:Strong_connectivity_augmentation
is
dcterms:
subject
of
dbr
:Menger's_theorem
dbr
:Biconnected_component
dbr
:Algebraic_connectivity
dbr
:Cycle_rank
dbr
:Vertex_separator
dbr
:Weak_component
dbr
:Connectivity_(graph_theory)
dbr
:Connected_dominating_set
dbr
:Component_(graph_theory)
dbr
:Path_(graph_theory)
dbr
:Gammoid
dbr
:K-edge-connected_graph
dbr
:K-vertex-connected_graph
dbr
:Karger's_algorithm
dbr
:Cut_(graph_theory)
dbr
:Balinski's_theorem
dbr
:Bridge_(graph_theory)
dbr
:Graph_toughness
dbr
:Graphic_matroid
dbr
:Pixel_connectivity
dbr
:Strongly_connected_component
dbr
:Structural_cohesion
dbr
:Rank_(graph_theory)
dbr
:Reachability
dbr
:Biconnected_graph
dbr
:Tarjan's_strongly_connected_components_algorithm
dbr
:St-connectivity
dbr
:Kosaraju's_algorithm
dbr
:SPQR_tree
dbr
:Strong_orientation
dbr
:Path-based_strong_component_algorithm
dbr
:Giant_component
dbr
:Robbins'_theorem
dbr
:Strength_of_a_graph
dbr
:Stoer–Wagner_algorithm
dbr
:Strong_connectivity_augmentation
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 3.0 Unported License