Search: concept:graph
|
Displaying 1-10 of 14 results found.
|
( next ) page 1 2
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP390 |
| Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms. |
|
| |
|
|
|
|
|
BP391 |
| There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2. |
|
| |
|
|
|
|
|
BP560 |
| There exists a closed trail that hits each edge exactly once vs. not so. |
|
| |
|
|
|
|
|
BP562 |
| There exists a closed trail that hits each vertex exactly once vs. not so. |
|
| |
|
|
|
|
|
BP576 |
| Vertices may be partitioned into two sets such that no two vertices in the same set are connected versus not so. |
|
| |
|
|
|
|
|
BP788 |
| Graph contains a "loop" a.k.a. cycle (cyclic) versus graph is acyclic. |
|
| |
|
|
|
|
|
BP905 |
| Graph can be redrawn such that no edges intersect vs. not so. |
|
| |
|
|
|
|
|
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
|
|
|
|
|
| |
|
|
REFERENCE
|
Henneberg, L. (1911), Die graphische Statik der starren Systeme, Leipzig
Jackson, Bill. (2007). Notes on the Rigidity of Graphs.
Laman, Gerard. (1970), "On graphs and the rigidity of plane skeletal structures", J. Engineering Mathematics, 4 (4): 331–340.
Pollaczek‐Geiringer, Hilda (1927), "Über die Gliederung ebener Fachwerke", Zeitschrift für Angewandte Mathematik und Mechanik, 7 (1): 58–72. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP1011 BP1012 BP1013 BP1014 BP1015  *  BP1017 BP1018 BP1019 BP1020 BP1021
|
|
KEYWORD
|
nice, physics, help
|
|
CONCEPT
|
rigidity (info | search), graph (info | search), imagined_motion (info | search)
|
|
WORLD
|
planar_connected_graph [smaller | same | bigger] zoom in left (rigid_planar_connected_graph)
|
|
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
|
|
|
|
|
|
|
|
|
|