• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Pseudoforest     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatDirectedGraphs, within Data Space : dbpedia.org associated with source document(s)

Type: softwareyago:Abstraction100002137yago:Communication100033020yago:Family108078020yago:Graph107000195yago:Group100031264yago:Organization108008335yago:WikicatGraphFamiliesyago:YagoLegalActoryago:YagoLegalActorGeoyago:YagoPermanentlyLocatedEntityyago:SocialGroup107950920yago:Unit108189659yago:VisualCommunication106873252yago:WikicatDirectedGraphs New Facet based on Instances of this Class

In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.