This paper investigates allocation rules in graph-structured cooperative games (hereinafter referred to as graph games) by integrating the notion of network control. A component-restricted game and ...

A comprehensive system for generating, storing, and querying zero divisor graphs and exact zero divisor graphs for modular arithmetic rings Z_n. The system uses SQLite for portable data storage and ...

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...