- M. Manjuri and B. Maheswari 2014. Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs. International Journal of Applied Information Systems. 7, 4 (June 2014), 15-21. DOI=http://dx.doi.org/10.5120/ijais451185
-
@article{10.5120/ijais2017451568, author = {M. Manjuri and B. Maheswari}, title = {Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs}, journal = {International Journal of Applied Information Systems}, issue_date = {June 2014}, volume = {7}, number = {}, month = {June}, year = {2014}, issn = {}, pages = {15-21}, numpages = {}, url = {/archives/volume7/number4/636-1185}, doi = { 10.5120/ijais14-451185}, publisher = { xA9 2013 by IJAIS Journal}, address = {} }
-
%1 451185 %A M. Manjuri %A B. Maheswari %T Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs %J International Journal of Applied Information Systems %@ %V 7 %N %P 15-21 %D 2014 %I xA9 2013 by IJAIS Journal
Abstract
This study set out to identify methods that phishers employ to attack unsuspecting internet users. The aim was for the purpose of minimizing their effects on websites as well as users. Eleven statements, namely, Emails, Web based, Malware based, Internet Relay Chats (IRC's) Man in the middle (MITM) Domain Name Server (DNS) based, Impersonate, Forward Attack, Pop-up attack, Voice Phishing and Mobile Phishing, depicting methods used by phishers to carry out their attacks against unsuspecting victims who are the internet users were presented to respondents to indicate their level of agreement. The result showed that only two, (MITM and Web based) out of the eleven were not significant while the remaining nine were significant. That means only the two strategies of attacks are not really dangerous as such can be ignored. This also indicates a high level of danger posed by phishers. Suggestion for further studies was made.
References
- Madhavi, L. - Studies on domination parameters and enumeration of cycles in some Arithmetic graphs, Ph. D. Thesis submitted to S. V. University, Tirupati, India (2002).
- Manjuri, M. and Maheswari, B. - Strong dominating sets of Euler totient Cayley graph and Arithmetic Vn graphs, International Journal of Computer Applications (IJCA), Volume 83, No3 (2013), 36-40.
- Nathanson and B. Melvyn, -Connected components of arithmetic graphs, Monat. fur. Math, 29, (1980), 219 – 220.
- Sampathkumar, E. and Pushpa Latha, L. -, Strong weak domination and domination balance in graph, Discrete Mathematics, 161 (1996), 235-242.
- Uma Maheswari, S. - Some studies on the product graphs of Euler totient Cayley graphs and Arithmetic Vn graphs, Ph. D. Thesis submitted to S. P. Women's University, Tirupati, India (2012).
- Whitehead, A. N. , Russel, B. - Principia Mathematica, Volume 2, Cambridge University Press, Cambridge (1912).
Keywords
Euler totient Cayley graph, Arithmetic V_n graph, direct product graph, Strong dominating set.