Electronic Journal of Graph Theory and Applications (EJGTA) Vol. In this paper a review of the works carried out in the field of Cryptography which use the concepts of Graph Theory, is given. endobj To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of … << >>>> endstream @Mʩ�� {}�� We use cookies to distinguish you from other users and to provide you with a better experience on our websites. )�,��������X�f���8p�=���Cfh�;o$M\$q�0�s�����yq���/7��:�B���%�fmb�OGQH��HJh>>�y2JE҈j�@��.p� �M�%� /Length 54 The online subscription to EJGTA is free. <>stream /Type /XObject /FormType 1 Then enter the ‘name’ part of your Kindle email address below. %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz��������������������������������������������������������������������������� Compiled by Hemanshu Kaul (email me with any suggestions/ omissions/ broken links) Selected Journal List. /Length 2451 Graph Drawing Tutorial (pdf) by Isabel F. Cruz and Roberto Tamassia; Graph Theory (pdf) byReinhard Diestel-- Free searchable and hyperlinked electronic edition of the book. [250 0 0 0 0 0 0 0 0 0 0 0 250 0 250 0 500 500 500 500 500 500 500 500 500 500 333 0 0 0 0 0 0 611 611 667 722 611 0 722 722 333 0 0 556 833 0 0 611 0 611 500 556 722 611 833 0 0 0 0 0 0 0 0 0 500 500 444 500 444 278 500 500 278 278 444 278 722 500 500 500 500 389 389 278 500 444 667 444 444] 29 0 obj ����� �i�>���p}&���d�gb�7E��u�I�F7i+���Ԅ�����^^������>ۺ�X��Y��?6^��E��sXe�D���#����NV�98Q)�A Np�gp)�$���q�grOֹ��,l�s#�����E�6��L'��`��#�&�)���i 4���A����2�+.��S�M�\�h^�|n��i�҉��ƤAm�Z_�>��d�� ,~��n=R0"���`�u}�nI8��r�����)0s�% ��'R����)[�D�o�V�?8�G{k?Jio� <> endobj 6 0 obj >> 7 0 obj [51 0 R] stream <> 34 0 obj 22 0 obj Registered in England & Wales No. �WbB O�XV.�nH��0I‹8�/��K/}{{C8K?�]6Qłm��~� ]eɰQ����BÉ}� �y������R Some of the Cryptographic Algorithms based on general graph theory concepts, Extremal Graph Theory and Expander Graphs are analyzed. In this paper, such a methodology is described. /Type /XObject endobj endobj endobj 3099067 If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. /Filter /FlateDecode &R�����A��F=�����n�4�#P��U� *b�N�Q�\�e��q:+ҢT���c]��c� ‰4��ĀK�:A�$�@� ��! <>/Encoding<>/ToUnicode 45 0 R/FontMatrix[0.001 0 0 0.001 0 0]/Subtype/Type3/Widths[611 0 0 0 333 389 0 0 0 0 0 0 0 667 0 611]/LastChar 84/FontBBox[17 -15 676 663]/Type/Font>> [5] ORE, O, theory of graphs American mathematical Register to receive personalised research and resources by email, A Survey on some Applications of Graph Theory in Cryptography, Centre for Research and Development PRIST University Thanjavur India. <> 12 0 obj @�A�[W����3���r�l���g���� A graph G=(V,E) is an ordered pair where V is the finite non empty set of vertices and E is the set of edges. 2 (2020), I Nengah Suparta, I Dewa M. Agus Ariawan, Sanhan Muhammad Salih Khasraw, Ivan Dler Ali, Rashad Rashid Haji, Diari Indriati, W. Widodo, Indah E. Wijayanti, Kiki A. Sugeng, Isnaini Rosyida, Martina Furrer, Norbert Hungerbühler, Simon Jantschgi, Heather Newman, Hector Miranda, Rigoberto Flórez, Darren A Narayan, Hamideh Hasanzadeh Bashir, Karim Ahmadidelir, Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari, Dimas Agus Fahrudin, Suhadi Wido Saputro, Denny Riama Silaban, Edy Tri Baskoro, Saladin Uttunggadewa, Rinovia Simanjuntak, Susilawati Susilawati, Edy Tri Baskoro, Martin Baca, Kadarkarai Muthugurupackiam, KM. In the present paper I am going to prove that.