SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
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, ...
Taiwanese Journal of Mathematics, Vol. 22, No. 1 (February 2018), pp. 1-15 (15 pages) A. A. Abueida and M. Daven, Multidesigns for graph-pairs of order 4 and 5 ...
Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...
Examines graph theory, trees, algebraic systems, Boolean algebra, groups, monoids, automata, machines, rings and fields, applications to coding theory, logic design ...
MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...
It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback