hasIndependenceNumberOfPointGraph
P97261
predicate
Indicates that a specified value is the independence number (size of the largest set of mutually non-adjacent vertices) of a given point graph.
All labels observed (1)
| Label | Occurrences |
|---|---|
| hasIndependenceNumberOfPointGraph canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: hasIndependenceNumberOfPointGraph
Generated description
Indicates that a specified value is the independence number (size of the largest set of mutually non-adjacent vertices) of a given point graph.
Sample triples (1)
| Subject | Object |
|---|---|
| Fano plane | 3 ⓘ |