|
gptkbp:instanceOf
|
graph
|
|
gptkbp:canBeConnected
|
True
|
|
gptkbp:canBeDisconnected
|
True
|
|
gptkbp:canBeMultigraph
|
True
|
|
gptkbp:canBeSimple
|
True
|
|
gptkbp:canBeUnweighted
|
True
|
|
gptkbp:canBeWeighted
|
True
|
|
gptkbp:contrastsWith
|
Directed Graph
|
|
gptkbp:cycle
|
Cycle
|
|
gptkbp:degree
|
Vertex Degree
|
|
gptkbp:edge
|
Undirected Edge
|
|
gptkbp:hasApplication
|
Social Network Analysis
Electrical Circuits
Transportation Networks
Molecular Structure
|
|
gptkbp:hasEdge
|
gptkb:Edge
|
|
gptkbp:hasProperty
|
Edge (u,v) = Edge (v,u)
No Edge Direction
Symmetric Adjacency Matrix
|
|
gptkbp:hasRoute
|
Path
|
|
gptkbp:hasSpecialCase
|
gptkb:tree
Bipartite Graph
Chordal Graph
Complete Graph
Cubic Graph
Cycle Graph
Line Graph
Null Graph
Path Graph
Planar Graph
Random Graph
Regular Graph
|
|
gptkbp:hasSubgraph
|
Subgraph
|
|
gptkbp:hasVertex
|
gptkb:Vertex
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Undirected Graph
|
|
gptkbp:represents
|
Adjacency List
Adjacency Matrix
Incidence Matrix
|
|
gptkbp:studiedBy
|
gptkb:mathematician
|
|
gptkbp:supportsAlgorithm
|
gptkb:Breadth-First_Search
gptkb:Depth-First_Search
gptkb:Minimum_Spanning_Tree
Connected Components
Graph Coloring
|
|
gptkbp:usedIn
|
gptkb:Graph_Theory
gptkb:Network_Analysis
Chemistry
Computer Science
Biology
|
|
gptkbp:bfsParent
|
gptkb:Connected_Undirected_Graph
gptkb:Vertex_Cover
gptkb:Minimum_Spanning_Tree
gptkb:Undirected_Hamiltonian_Cycle
gptkb:Undirected_Hamiltonian_Path
gptkb:Graphical_Models
|
|
gptkbp:bfsLayer
|
7
|