• 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: Friendly-index set     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatGraphInvariants, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)

Type: yago:Abstraction100002137yago:Cognition100023271yago:Concept105835747yago:Content105809192yago:Feature105849789yago:Idea105833840yago:Invariant105850432yago:Property105849040yago:PsychologicalFeature100023100yago:WikicatGraphInvariants New Facet based on Instances of this Class

In graph theory, a friendly-index set is a finite set of integers associated with a given undirected graph and generated by a type of graph labeling called a friendly labeling. A friendly labeling of an n-vertex undirected graph G = (V,E) is defined to be an assignment of the values 0 and 1 to the vertices of G with the property that the number of vertices labeled 0 is as close as possible to the number of vertices labeled 1: they should either be equal (for graphs with an even number of vertices) or differ by one (for graphs with an odd number of vertices).