ABSTRACT: A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for some . We solve the problem of ...
ABSTRACT: A friendship graph is a graph consisting of cliques sharing a common vertex. In this paper we investigate the maximum number of elements in an optimal friendship decomposition of graphs of ...
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 ...
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, ...
National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH), Kalasalingam University, Anand Nagar, Krishnankoil-626 126, India Also at School of Electrical Engineering and Computer ...
A pretty bog-standard and unprofessional graph library made by 3 CS undergrads for our discrete maths class. It has a couple of graphviz output functions, as declared in iodot.h. Use it to gaze at the ...
If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...
We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback