OEBP History

Revision history for BP932

Displaying 1-9 of 9 results found.

page 1

Edits shown per page: 25.

on 2022-04-10 10:52:44 by Aaron David Fairbanks approved

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."

on 2021-02-03 18:00:52 by Leo Crabbe approved

?DATA

EX6533

EX6525

on 2021-02-03 18:00:11 by Leo Crabbe approved

+DATA

EX6533

EX6525

on 2020-07-25 02:16:04 by Aaron David Fairbanks approved

COMMENTS

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."

EXAMPLE

on 2020-07-25 02:14:56 by Aaron David Fairbanks approved

	NAME	`Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections).`
	COMMENTS
	EXAMPLE

on 2020-07-25 02:14:28 by Aaron David Fairbanks approved

	NAME	`Every vertex is connected to every other vs. all vertices are connected in a cycle (no other connections).`
	COMMENTS
	EXAMPLE

on 2020-07-22 20:54:08 by Aaron David Fairbanks approved

	NAME	`Every vertex is connected to every other vs. only a cycle of vertices are connected.`
	COMMENTS	`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."`
	EXAMPLE
	AUTHOR	`Aaron David Fairbanks`

+DATA

EX6260

EX6261

EX6262

EX6263

EX6264

EX6265

-DATA

EX6266

EX6267

EX6268

EX6269

EX6270

EX6271