• 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: Tutte polynomial     Goto   Sponge   NotDistinct   Permalink

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

Type: yago:WikicatComputationalProblemsyago:Abstraction100002137yago:Attribute100024264yago:Cognition100023271yago:Concept105835747yago:Condition113920835yago:Content105809192yago:Difficulty114408086yago:Explanation105793000yago:Feature105849789yago:Function113783816yago:HigherCognitiveProcess105770664yago:Idea105833840yago:Invariant105850432yago:MathematicalRelation113783581yago:Polynomial105861855yago:Problem114410605yago:Process105701363yago:Property105849040yago:PsychologicalFeature100023100yago:Relation100031921yago:WikicatGraphInvariantsyago:State100024720yago:Theory105989479yago:Thinking105770926yago:WikicatDualityTheoriesyago:WikicatPolynomials New Facet based on Instances of this Class

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is defined for every undirected graph and contains information about how the graph is connected. It is denoted by .