Graph power
flowchart
AA["Associated Authors (0)"]
C[Graph power]
BC["Broader Concepts (1)"]
NC["Narrower Concepts (51)"]
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/Q5597091
- OpenAlex ID
- https://openalex.org/C149530733 (API record)
- OpenAlex Description
- None
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Biconnected graph
- Bound graph
- Brooks' theorem
- Circle graph
- Circulant graph
- Clique graph
- Complement graph
- Complete coloring
- Critical graph
- Cycle basis
- Degree matrix
- Distance-hereditary graph
- Distance-regular graph
- Edge coloring
- Edge contraction
- Edge-graceful labeling
- Edge-transitive graph
- Factor-critical graph
- Foster graph
- Fractional coloring
- Frequency partition of a graph
- Friendship graph
- Geometric graph theory
- Graph bandwidth
- Graph energy
- Graph factorization
- Graph homomorphism
- Graph labeling
- Graph minor
- Greedy coloring
- Hypercube graph
- Induced path
- Integral graph
- List coloring
- Path graph
- Perfect graph
- Petersen graph
- Polyhedral graph
- Quartic graph
- Regular graph
- Resistance distance
- Simplex graph
- Spectral graph theory
- Strength of a graph
- Strongly regular graph
- Total coloring
- Triangle-free graph
- Two-graph
- Vertex-transitive graph
- Wheel graph
- Windmill graph
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.
HelioWeb