Zero-divisor graphs provide a graphical framework to capture interactions among zero-divisors in a commutative ring. Given a commutative ring R with identity, one constructs a simple graph whose ...
Now that pandemic restrictions are easing up, people are getting together again. But it’s been a while, so if you and your friends need some help breaking the ice, here’s a mathematical party game you ...
Matching preclusion examines the resilience of a network modelled as a graph by identifying the smallest set of edge removals that destroys all perfect matchings. Originating in the study of ...
Researchers have proved a special case of the Erdős-Hajnal conjecture, which shows what happens in graphs that exclude anything resembling a pentagon. When you walk into a room full of people, you can ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results