Outrageously Funny Word Dictionary :: Overrigidity

👉 In mathematics, overrighidity is a property of graphs that describes how strongly any vertex in the graph is connected to others. Overrigidity can be defined as the minimum number of edges required to connect two vertices in a graph such that there exists an edge between them. In other words, it measures how much stronger a graph is compared to its overfullness (i.e., when all vertices are fully connected and no edges exist). This concept is crucial for understanding the connectivity properties of graphs

overrigidity