Syafrizal Sy

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
under the Creative Commons Attribution License, which permits unrestricted use, distribution , and reproduction in any medium, provided the original work is properly cited. Abstract For graphs G 1 , G 2 , · · · , G k , the (generalized) size multipartite Ramsey number m j (G 1 , G 2 , · · · , G k) is the least natural number l so that any colouring of the(More)
For given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G1, G2) = t is the smallest integer such that every factorization of graph Kj×t := F1 ⊕ F2 satisfies the following condition: either F1 contains G1 as a subgraph or F2 contains G2 as a subgraph. In this paper, we determine that mj(K1,m, Pl) for l ≥ 2 where K1,n is a(More)
For given two graphs G1 and G2, and integer j ≥ 2, the size multipartite Ramsey numbers mj(G1,G2) is the smallest integer t such that every factorization of the graph Kj×t := F1 ⊕ F2 satisfies the following condition: either F1 contains G1 or F2 contains G2. In this paper, we determine mj(S m,Cn) for j,m, n ≥ 3 where S m is a star on m vertices and Cn is a(More)
For simple graphs G1 and G2, the size Ramsey multipartite number mj(G1, G2) is defined as the smallest natural number s such that any arbitrary two coloring of the graph Kj×s using the colors red and blue, contains a red G1 or a blue G2 as subgraphs. In this paper, we obtain the exact values of the size Ramsey numbers mj(nK2, Cm) for j ≥ 2 and m ∈ {3, 4, 5,(More)
A path in an edge−colored graph is said to be a rainbow path if every edge in the path has different color. An edge colored graph is rainbow connected if there exists a rainbow path between every pair of vertices. The rainbow connection of a graph G, denoted by rc(G), is the smallest number of colors required to color the edges of graph such that the graph(More)
  • 1