Electronics Circuits & Tutorials

Home

About us

Electronic Tutorials

Engineering Hobby Projects

Online Dictionaries

Home > Electronics Tutorials > Online Computer Terms Dictionary > M

Online Computer Terms Dictionary - M

Moore bound

An upper limit on the number of nodes in a regular graph of degree d>2 and diameter k:

	N(d,k) <= d(d-1)^k - 2
		  ------------
		      d-2

Nearby terms: monty « MOO « Moof « Moore bound » Moore graph » Moore's Law » moose call

Discover

Home

Electronic Tutorials

Engineering Hobby Projects

Resources Links

Sitemap

Copyright © 1999-2020 www.hobbyprojects.com (All rights reserved)