Taiwanese Journal of Mathematics, Vol. 24, No. 4 (August 2020), pp. 785-815 (31 pages) In 2011, Caro et al. introduced the monochromatic connection of graphs. An edge-coloring of a connected graph G ...

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, ...

Companies that want to use powerful graph algorithms to explore hidden connections in their data may want to check out TigerGraph, which today unveiled a pair of cloud-based offerings designed to ...

There is nearly limitless potential for smart home automation to alter the way that humans go about about their days. With innovations like smart kitchen appliances, custom weather forecasts and even ...