Select language: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi Concept: English word: Home

a TernaryPredicate that specifies the GraphArc connecting two GraphNodes.

## Ontology

SUMO / GRAPH-THEORY

## Class(es)

 varga

inheritable relation

triangii lakshana

## Coordinate term(s)

altitude  between  capability  conditional probability  confers obligation  confers right  connects  depth  distance  domain  domain subclass  has purpose for agent  occupies position  orientation  prefers  related external concept  represents for agent  represents in language  temporally between  temporally between or equal

## Type restrictions

links(granthi aalekha, granthi aalekha, chaapa aalekha)

## Axioms (7)

Agar graph is an instance of aalekha aur node1 is an instance of granthi aalekha aur node2 is an instance of granthi aalekha aur node1 is a part of graph aur node2 is a part of graph aur node1 is not equal to node2, to yah kuch arc,path nahin, ki
```(=>
(and
(instance ?GRAPH Graph)
(instance ?NODE1 GraphNode)
(instance ?NODE2 GraphNode)
(graphPart ?NODE1 ?GRAPH)
(graphPart ?NODE2 ?GRAPH)
(not
(equal ?NODE1 ?NODE2)))
(exists
(?ARC ?PATH)
(or
(and
(subGraph ?PATH ?GRAPH)
(instance ?PATH GraphPath)
(or
(and
(equal
(BeginNodeFn ?PATH)
?NODE1)
(equal
(EndNodeFn ?PATH)
?NODE2))
(and
(equal
(BeginNodeFn ?PATH)
?NODE2)
(equal
(EndNodeFn ?PATH)
?NODE1)))))))```

Agar graph is an instance of aalekha, to yah kuch node1,node2,node3,arc1,arc2 nahin, ki node1 is a part of graph aur node2 is a part of graph aur node3 is a part of graph aur arc1 is a part of graph aur arc2 is a part of graph aur node2 links arc1 and node1 aur node3 links arc2 and node2 aur node1 is not equal to node2 aur node2 is not equal to node3 aur node1 is not equal to node3 aur arc1 is not equal to arc2.
```(=>
(instance ?GRAPH Graph)
(exists
(?NODE1 ?NODE2 ?NODE3 ?ARC1 ?ARC2)
(and
(graphPart ?NODE1 ?GRAPH)
(graphPart ?NODE2 ?GRAPH)
(graphPart ?NODE3 ?GRAPH)
(graphPart ?ARC1 ?GRAPH)
(graphPart ?ARC2 ?GRAPH)
(not
(equal ?NODE1 ?NODE2))
(not
(equal ?NODE2 ?NODE3))
(not
(equal ?NODE1 ?NODE3))
(not
(equal ?ARC1 ?ARC2)))))```

graph is an instance of bahu aalekha agar hai yah kuch arc1,arc2,node1,node2 nahin, ki arc1 is a part of graph aur arc2 is a part of graph aur node1 is a part of graph aur node2 is a part of graph aur arc1 links node1 and node2 aur arc2 links node1 and node2 aur arc1 is not equal to arc2.
```(<=>
(instance ?GRAPH MultiGraph)
(exists
(?ARC1 ?ARC2 ?NODE1 ?NODE2)
(and
(graphPart ?ARC1 ?GRAPH)
(graphPart ?ARC2 ?GRAPH)
(graphPart ?NODE1 ?GRAPH)
(graphPart ?NODE2 ?GRAPH)
(not
(equal ?ARC1 ?ARC2)))))```

Agar node is an instance of granthi aalekha, to yah kuch other,arc nahin, ki arc links node and other.
```(=>
(instance ?NODE GraphNode)
(exists
(?OTHER ?ARC)

Agar arc is an instance of chaapa aalekha, to yah kuch node1,node2 nahin, ki arc links node1 and node2.
```(=>
(instance ?ARC GraphArc)
(exists
(?NODE1 ?NODE2)
```(<=>
```(=>