Search: ex:EX6525
|
Displaying 1-3 of 3 results found.
|
page 1
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP788 |
| Graph contains a "loop" a.k.a. cycle (cyclic) versus graph is acyclic. |
|
| |
|
|
|
|
|
BP932 |
| Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections). |
|
| ?
| ?
|
|
|
|
COMMENTS
|
Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).
Left examples are called "fully connected graphs." Right examples are called "cycle graphs." |
|
CROSSREFS
|
Adjacent-numbered pages:
BP927 BP928 BP929 BP930 BP931  *  BP933 BP934 BP935 BP936 BP937
|
|
KEYWORD
|
precise, left-narrow, right-narrow, both, preciseworld
|
|
CONCEPT
|
graph (info | search), distinguishing_crossing_curves (info | search), all (info | search), loop (info | search)
|
|
WORLD
|
connected_graph [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP1099 |
| Considering only the ways they are connected, anything that can be said about a given node can be said about every other node vs. not so. |
|
| |
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|