SWEET Ontology Representation Mathematics Graph

Classes

arc^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Arc

has super-classes: structural component^c; has ordered vertex pair exactly 1

circuit^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Circuit

is equivalent to: cycle^c

connected graph^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/ConnectedGraph

has super-classes: graph^c

cycle^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Cycle

has super-classes: path^c; path^c

digraph^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Digraph

is equivalent to: directed graph^c

directed graph^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/DirectedGraph

has super-classes: graph^c; has arc min 1
is disjoint with: undirected graph^c

edge^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Edge

has super-classes: structural component^c; has unordered vertex pair exactly 1
has sub-classes: loop^c, weighted edge^c

forest^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Forest

has super-classes: graph^c

graph^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Graph

has super-classes: structural model^c; has vertex min 1; has edge min 1
has sub-classes: connected graph^c, directed graph^c, forest^c, network^c, tree^c, undirected graph^c

isolated vertex^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/IsolatedVertex

has super-classes: vertex^c

leaf node^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/LeafNode

has super-classes: node^c

loop^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Loop

has super-classes: edge^c

network^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Network

has super-classes: graph^c; has weighted edge min 1

node^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Node

is equivalent to: vertex^c
has sub-classes: leaf node^c

ordered vertex pair^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/OrderedVertexPair

has super-classes: ordered pair; each element has type only vertex^c

path^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Path

has super-classes: array; each element has type only edge^c
has sub-classes: cycle^c

structural component^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/StructuralComponent

has super-classes: structural model^c
has sub-classes: arc^c, edge^c, vertex^c

structural model^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/StructuralModel

has super-classes: model^c
has sub-classes: graph^c, structural component^c

tree^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Tree

has super-classes: graph^c

undirected graph^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/UndirectedGraph

has super-classes: graph^c
is disjoint with: directed graph^c

unordered vertex pair^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/UnorderedVertexPair

has super-classes: unordered pair; each element has type only vertex^c

vertex^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/Vertex

is equivalent to: vertice^c
has super-classes: point; structural component^c
has sub-classes: isolated vertex^c

weighted edge^c back to ToC or Class ToC

IRI: http://sweetontology.net/reprMathGraph/WeightedEdge

has super-classes: edge^c; has weight exactly 1

This HTML document was obtained by processing the OWL ontology source code through LODE, Live OWL Documentation Environment, developed by Silvio Peroni.

SWEET Ontology Representation Mathematics Graph

Table of Content

Classes

arc^c back to ToC or Class ToC

circuit^c back to ToC or Class ToC

connected graph^c back to ToC or Class ToC

cycle^c back to ToC or Class ToC

digraph^c back to ToC or Class ToC

directed graph^c back to ToC or Class ToC

edge^c back to ToC or Class ToC

forest^c back to ToC or Class ToC

graph^c back to ToC or Class ToC

isolated vertex^c back to ToC or Class ToC

leaf node^c back to ToC or Class ToC

loop^c back to ToC or Class ToC

network^c back to ToC or Class ToC

node^c back to ToC or Class ToC

ordered vertex pair^c back to ToC or Class ToC

path^c back to ToC or Class ToC

structural component^c back to ToC or Class ToC

structural model^c back to ToC or Class ToC

tree^c back to ToC or Class ToC

undirected graph^c back to ToC or Class ToC

unordered vertex pair^c back to ToC or Class ToC

vertex^c back to ToC or Class ToC

weighted edge^c back to ToC or Class ToC

Namespace Declarations back to ToC

SWEET Ontology Representation Mathematics Graph

Table of Content

Classes

arcc back to ToC or Class ToC

circuitc back to ToC or Class ToC

connected graphc back to ToC or Class ToC

cyclec back to ToC or Class ToC

digraphc back to ToC or Class ToC

directed graphc back to ToC or Class ToC

edgec back to ToC or Class ToC

forestc back to ToC or Class ToC

graphc back to ToC or Class ToC

isolated vertexc back to ToC or Class ToC

leaf nodec back to ToC or Class ToC

loopc back to ToC or Class ToC

networkc back to ToC or Class ToC

nodec back to ToC or Class ToC

ordered vertex pairc back to ToC or Class ToC

pathc back to ToC or Class ToC

structural componentc back to ToC or Class ToC

structural modelc back to ToC or Class ToC

treec back to ToC or Class ToC

undirected graphc back to ToC or Class ToC

unordered vertex pairc back to ToC or Class ToC

vertexc back to ToC or Class ToC

weighted edgec back to ToC or Class ToC

Namespace Declarations back to ToC

arc^c back to ToC or Class ToC

circuit^c back to ToC or Class ToC

connected graph^c back to ToC or Class ToC

cycle^c back to ToC or Class ToC

digraph^c back to ToC or Class ToC

directed graph^c back to ToC or Class ToC

edge^c back to ToC or Class ToC

forest^c back to ToC or Class ToC

graph^c back to ToC or Class ToC

isolated vertex^c back to ToC or Class ToC

leaf node^c back to ToC or Class ToC

loop^c back to ToC or Class ToC

network^c back to ToC or Class ToC

node^c back to ToC or Class ToC

ordered vertex pair^c back to ToC or Class ToC

path^c back to ToC or Class ToC

structural component^c back to ToC or Class ToC

structural model^c back to ToC or Class ToC

tree^c back to ToC or Class ToC

undirected graph^c back to ToC or Class ToC

unordered vertex pair^c back to ToC or Class ToC

vertex^c back to ToC or Class ToC

weighted edge^c back to ToC or Class ToC