In mathematics, a degenerate case is a limiting case of a class of objects which appears to be qualitatively different from the rest of the class, and the term degeneracy is the condition of being a degenerate case.
In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph's edges.
Within biological systems, degeneracy occurs when structurally dissimilar components/pathways can perform similar functions under certain conditions, but perform distinct functions in other conditions.
Preferred languages to be displayed in the selection menus
Please note that, in order to improve your browsing experience on this website,
BabelNet® uses various types of cookies, including: browsing functionality,
performance and statistical cookies.
By continuing to browse the site you are agreeing to our use of cookies.
OK