The On-Line Encyclopedia of Bongard Problems

Search: concept:graph

Displaying 11-16 of 16 results found.

( prev ) page 1 2

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

There is a path between any two nodes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Graph_theory` `https://en.wikipedia.org/wiki/Connectivity_(graph_theory)`
	CROSSREFS	`Adjacent-numbered pages: BP1095 BP1096 BP1097 BP1098 BP1099 * BP1101 BP1102 BP1103 BP1104 BP1105`
	KEYWORD	`precise, allsorted, world, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `connected_component (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left (connected_graph) \| zoom in right (disconnected_graph)`
	AUTHOR	`Leo Crabbe`

Each node is connected to the same number of nodes by straight lines vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Regular_graph`
	CROSSREFS	`Any left example of BP1099 will be a left example for this BP.` `Adjacent-numbered pages: BP1096 BP1097 BP1098 BP1099 BP1100 * BP1102 BP1103 BP1104 BP1105 BP1106`
	KEYWORD	`precise, allsorted, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left`
	AUTHOR	`Leo Crabbe`

Nodes share the same edge connections as the vertices of a cube vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://mathworld.wolfram.com/CubicalGraph.html`
	CROSSREFS	`Adjacent-numbered pages: BP1097 BP1098 BP1099 BP1100 BP1101 * BP1103 BP1104 BP1105 BP1106 BP1107`
	KEYWORD	`precise, allsorted, arbitrary, help, preciseworld`
	CONCEPT	`graph (info \| search),` `cube (info \| search),` `distinguishing_crossing_curves (info \| search),` `topological_transformation (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

Considering only the ways they are connected, anything that can be said about a given edge can be said about every other edge vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://mathworld.wolfram.com/Edge-TransitiveGraph.html`
	CROSSREFS	`Adjacent-numbered pages: BP1104 BP1105 BP1106 BP1107 BP1108 * BP1110 BP1111 BP1112 BP1113 BP1114`
	KEYWORD	`precise, allsorted, notso, math, left-narrow, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

If two nodes are linked, they are each linked to a different number of nodes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Highly_irregular_graph`
	CROSSREFS	`Adjacent-numbered pages: BP1278 BP1279 BP1280 BP1281 BP1282 * BP1284 BP1285 BP1286 BP1287 BP1288`
	CONCEPT	`graph (info \| search)`
	AUTHOR	`Leo Crabbe`

Black points are the set of vertices that are some shortest-distance away from some white vertex vs. not so.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Left hand examples can be thought of as "graph circles".`
	CROSSREFS	`https://en.wikipedia.org/wiki/Level_structure` `Adjacent-numbered pages: BP1286 BP1287 BP1288 BP1289 BP1290 *`
	KEYWORD	`precise, unwordable, notso, left-narrow`
	CONCEPT	`graph (info \| search)`
	AUTHOR	`Leo Crabbe`

( prev ) page 1 2

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)