The number of edges in a complimentary graph to the original graph g with n vertices is the nth triangular number minus the number of edges on the original graph
The number of edges in a complimentary graph to the original graph g with n vertices is the nth triangular number minus the number of edges on the original graph
Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.
All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.