Chang Graph
From EverybodyWiki Bios & Wiki
The Chang Graph (CG) is a simple, non-directed mathematical graph defined by the following features:[1]
- A regular, n-sided convex polygon.
- A regular, 2n-sided star polygon, inscribed within the n-sided polygon.
The most common form of the Chang Graph contains 8 vertices and 12 edges, as seen below.
References
- ↑ Chang, Alex. "A Theoretical Approach to Complex Systems Analysis: Simple Non-Directed Graphs as Homogenous, Morphological Models" (PDF). Brandeis University. Retrieved 11/21/2020. Check date values in:
|accessdate=(help)
Chang Graph
This article "Chang Graph" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Chang Graph. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
