Restricted size Ramsey numbers and restricted size Ramsey minimal graphs for matching versus wheel upto order six

Sharma, Isha; Jakhar, Jagjeet

doi:10.47974/JIM-1807

Open Access Research Article

Restricted size Ramsey numbers and restricted size Ramsey minimal graphs for matching versus wheel upto order six

^*Isha SharmaCorresponding authorsharma08isha@gmail.comDepartment of Mathematics Central University of HaryanaHaryana, IndiaView full profile → , Jagjeet Jakharjagjeet@cuh.ac.inDepartment of Mathematics Central University of HaryanaHaryana, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 171–180Vol. 27Issue 2March 2024DOI: 10.47974/JIM-1807XML

Published Online:: 19 Mar 2024
Article type:: Research Article
Language:: EN
Article no.:: JIM-1807
Pages:: 171–180

Abstract

The notion of the restricted size Ramsey number arises from the amalgamation of the theory of Ramsey numbers and the size Ramsey number for graphs. The concept of the (restricted) size Ramsey number of small graphs was first introduced by Harary and Miller in 1983. They derived specific values for certain pairs of small graphs, each having a maximum count of four vertices. In that same year, R. J. Faudree and J. Sheehan furthered the research and expanded the findings to encompass all the pairs of small graphs with a maximum order of four. The restricted size Ramsey number and size Ramsey number for all pairs of small forests of maximum order five was given by Lortz and Mengersen in 1998. In this study, our research endeavours to advance the understanding of the restricted size Ramsey number by ascertaining the restricted size Ramsey numbers and restricted size Ramsey minimal graphs involving 2K2 and wheel graph upto order six. More specifically, we find r * (2K2, W3) = r* (2K2, W4) = 15 and r * (2K2, W5) = 19.

Keywords

Ramsey number Size Ramsey number Restricted size Ramsey number Restricted size Ramsey minimal graph 2K2 Wheel- graph

Subject Classifications

Primary 05C55Secondary 05C15

References

[1] D.R. Silaban, E.T. Baskoro and S. Uttunggadewa, Restricted size Ramsey number for P_3 versus dense connected graphs of order six, AIP Conf. Proc. 1862, p. 030136 (2017), AIP Publishing LLC.
[2] D.R. Silaban, E.T. Baskoro and S. Uttunggadewa, Restricted size Ramsey number for path of order three versus graph of order five, Elec. J. Graph Th. Appl. 5, p. 55843 (2017).
[3] D.R. Silaban, E.T. Baskoro and S. Uttunggadewa, Restricted size Ramsey number for 2K2 versus dense connected graph of order six, J. Phy.: Conf. Series 1008, p. 012034 (2018).
[4] D.R. Silaban, E.T. Baskoro and S. Uttunggadewa, On the restricted size Ramsey number, Proc. Comp. Sci. 74, 21-26 (2015).
[5] D.R. Silaban, E.T. Baskoro and S. Uttunggadewa, Restricted size Ramsey number involving matching and graph of order five, J. Fund. Sci. 52, 133- 142 (2020).
[6] E. Safitri, P. John and D. R. Silaban, Restricted size Ramsey number for 2K_2 versus disconnected graph of order six, J. Phy.: Conf. series 1722, 012048 (2021).
[7] E. Safitri, P. John and D. R. Silaban, Restricted size Ramsey number for matching versus tree and triangle unicyclic graphs of Order six, (IJCSAM) Int. J. Comp. Sci. Appl. Math. 8, 17-21 (2022).
[8] F. Harary and Z. Miller, Generalized Ramsey theory VIII. the size Ramsey number of small graphs, Stud. Pure Math., 271-283 (1983).
[9] I. Mengenser and J. Oeckermann, Matching- star Ramsey sets, Disc. App. Math. 95, 417-424 (1999).
[10] J. A. Bondy and U. S. R. Murty, Graph theory with applications (1982).
[11] J. Balogh, F. C. Clemen, E. Heath and M. Lavrov, Ordered size Ramsey number of paths, Disc. App. Math. 276, 13-18 (2020).
[12] J. Cyman and T. Dzido, Restricted size Ramsey number for $P_3$ versus cycle, Elec. J. Graph Th. Appl. 8, 365-372 (2020).
[13] M. H. Kadhim and R. K. K. Ajeena, Triple vertex of cycle graph for polyalphabetic encryption scheme, J. Disc. Math. Sci. & Crypto., 26, 1183–1188 (2023).
[14] N. J. Khalel and N. E. Arif, Associate graph of a commutative ring, J. Disc. Math. Sci. & Crypto., 26, 1883–1887 (2023).
[15] P. Erdos, R. J. Faudree, C. C. Rousseau, R. H. Schelp, The size Ramsey number, Period. Hung. 9, 145-61 (1978).
[16] R. Diestel, Graph theory, Springer- Verlag Heidelberg, New York, 4 edition, 2005.
[17] R. J. Faudree and J. Sheehan, Size Ramsey numbers involving stars, Disc. Math. 46, 151-157 (1983).
[18] R. J. Faudree and J. Sheehan, Size Ramsey numbers for small-order graphs, J. Graph Th. 7, 53-55 (1983).
[19] R. J. Faudree and R. H. Schelp, A survey of results on the size Ramsey number, Paul Erdos and his math. II (Budapest, 1999) 11, 291-309 (2002).
[20] R. Lortz and I. Mengersen, Size Ramsey results for paths versus stars, Aus. J. Comb. 18, 3-12 (1998).
[21] R. Lortz, I. Mengersen, Size Ramsey results for the path of order three, Graphs and Comb. 37, 2315-2331(2021).
[22] S. A. Burr, A survey of noncomplete Ramsey theory for graphs, in: Topics in graph theory, Annals New York Acad. Sd. 328, 58-75 (1979).
[23] V. Chvatal and F. Harary, Generalized Ramsey theory for graphs III: small off-diagonal numbers, Pac. J. Math. 41, 335-345 (1972).
[24] Kumar, Anil , Gupta, Amit Kumar , Panwar, Deepak , Chaurasia, Sandeep & Goyal, Dinesh. Operating system security with discrete mathematical structure for secure round robin scheduling method with intelligent time quantum, Journal of Discrete Mathematical Sciences and Cryptography, 26:5, 1519–1533 (2023).
[25] Kushwaha, Satpal Singh, Joshi, Sandeep & Gupta, Amit Kumar. An efficient approach to secure smart contract of Ethereum blockchain using hybrid security analysis approach, Journal of Discrete Mathematical Sciences and Cryptography, 26:5, 1499–1517 (2023), DOI: https://doi.org/10.47974/JDMSC-1815.
[26] Joshi, Ruchi, Mathur, Priya, Gupta, Amit Kumar, Singh, Suyesha, Paliwal, Vismita & Nayar, Sejal. Mathematical modeling of intelligent system for predicting effectiveness of premenstrual syndrome, Journal of Interdisciplinary Mathematics, 26:3, 551-562 (2023).

Views: 277Downloads: 15Citations: 0