chaapa aalekha (GraphArc)

Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes.

Ontology

SUMO / GRAPH-THEORY

Superclass(es)

astitva

amUrta

tatva aalekha

chaapa aalekha

Subclass(es)

aalekha paasha

Coordinate term(s)

granthi aalekha

Constrains relations

initial node fn terminal node fn arc weight links

Related WordNet synsets

See more related synsets on a separate page.

Axioms (5)

Agar graph is an instance of pratyaksha aalekha aur arc is an instance of chaapa aalekha aur arc is a part of graph, to yah kuch node1,node2 nahin, ki "the starting node of arc" is equal to node1 aur "the terminal node of arc" is equal to node2.

(=>
      (and
            (instance ?GRAPH DirectedGraph)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (exists
            (?NODE1 ?NODE2)
            (and
                  (equal
                        (InitialNodeFn ?ARC)
                        ?NODE1)
                  (equal
                        (TerminalNodeFn ?ARC)
                        ?NODE2))))

agar graph is an instance of aalekha patha aur arc is an instance of chaapa aalekha aur arc is a part of graph,
to agar "the starting node of arc" is equal to node, to yah kuch other nahin, ki "the starting node of other" is equal to node aur other is not equal to arc

(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (InitialNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (InitialNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))

agar graph is an instance of aalekha patha aur arc is an instance of chaapa aalekha aur arc is a part of graph,
to agar "the terminal node of arc" is equal to node, to yah kuch other nahin, ki "the terminal node of other" is equal to node aur other is not equal to arc

(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (TerminalNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (TerminalNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))

tatva aalekha is exhaustively partitioned into granthi aalekha,chaapa aalekha.

(partition GraphElement GraphNode GraphArc)

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)
            (links ?NODE1 ?NODE2 ?ARC)))