HelioWebGraph
flowchart
AA["Associated Authors (0)"]
C[Graph]
BC["Broader Concepts (3)"]
NC["Narrower Concepts (53)"]
C== skos:broader ==>BC
NC== skos:broader ==>C
AA== dcterms:relation ==>C
click BC "#broader-concepts"
click NC "#narrower-concepts"
click AA "#associated-authors"
NI["add incoming edge"]
NO["add outgoing edge"]
NI-- ? -->C
C-- ? -->NO
click NI "#add-incoming-edge"
click NO "#add-outgoing-edge"
style NI stroke-width:2px,stroke-dasharray: 5 5
style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q141488
- OpenAlex ID
- https://openalex.org/C132525143 (API record)
- OpenAlex Description
- mathematical structure; representation of a set of objects where some pairs of the objects are connected by links
- OpenAlex Level [?]
- 2
Broader Concepts
Narrower Concepts
- Adjacency matrix
- Algebraic graph theory
- Bipartite graph
- Cayley graph
- Chordal graph
- Chromatic polynomial
- Clique number
- Complete graph
- Connected dominating set
- Connectivity
- De Bruijn graph
- Dependency graph
- Edge cover
- Expander graph
- Exponential time hypothesis
- Finite graph
- Graph algorithms
- Graph coloring
- Graph database
- Graph drawing
- Graph embedding
- Graph partition
- Graph rewriting
- Graph traversal
- Hamiltonian path
- Independence number
- Independent set
- Indifference graph
- Kernelization
- Laplacian matrix
- Level structure
- Line graph
- Maximum cut
- Minimum degree spanning tree
- Molecular graph
- Multigraph
- Multiple edges
- Permutation graph
- Planar graph
- Power graph analysis
- Quantum graph
- Ramsey's theorem
- Random graph
- Shortest path problem
- Shortest-path tree
- Signed graph
- Simple graph
- Subgraph isomorphism problem
- Topological graph
- Undirected graph
- Vertex (graph theory)
- Vertex cover
- Wiener index
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.