• Dec 26, 2017 News! IJIET Vol. 6, No. 1-No. 10 have been indexed by EI (Inspec).   [Click]
  • Apr 26, 2018 News!Vol. 8, No. 6 has been indexed by Crossref.
  • Apr 12, 2018 News!Vol. 8, No. 6 issue has been published online!   [Click]
General Information
    • ISSN: 2010-3689
    • Frequency: Bimonthly (2011-2014); Monthly (Since 2015)
    • DOI: 10.18178/IJIET
    • Editor-in-Chief: Prof. Dr. Steve Thatcher
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: EI (INSPEC, IET), Electronic Journals Library, Google Scholar, Crossref and ProQuest
    • E-mail: ijiet@ejournal.net
Prof. Dr. Steve Thatcher
QUniversity, Australia
It is my honor to be the editor-in-chief of IJIET. The journal publishes good-quality papers which focous on the advanced researches in the field of information and education technology. Hopefully, IJIET will become a recognized journal among the scholars in the related fields.

IJIET 2013 Vol.3(5): 554-559 ISSN: 2010-3689
DOI: 10.7763/IJIET.2013.V3.334

Identifying Dominating Graphs over Vertex Connectivity and Order Constraint in a Social Network

Abhay A. Bhamaikar and Pralhad Ramchandra Rao
Abstract—Identifying highly robust graphs (i.e. graph having high vertex connectivity value) is a well known problem in the field of social network analysis. Robustness of a social network implicitly assumes that social links are dynamic and should be allowed to be changed with and without restrictions or constrains. In social network finding robust subgraphs is hard problem i.e. NP Complete Problem. The paper focuses on identifying whether the original graph is robust or not. It takes into consideration the Maximum degree, Minimum degree and Vertex Connectivity values of given Graph (G), based on which the algorithm determines above Property.
The algorithm uses vertex connectivity and order constraints to find robust subgraphs i.e. Dominating (H) from set of all induced subgraphs. The social network G is decomposed using minimum cut decomposition algorithm over vertex connectivity parameter. The skyline approach is used to determine the solution set Dominating (H). The computational time of algorithm is improved by using preprocessing techniques like identifying and deleting cut set vertices and also by using pruning strategies like minimum degree criteria.

Index Terms—Skyline, order, vertex connectivity, robustness.

Abhay A. Bhamaikar is with the Department of Information technology, Shree Rayeshwar Institute of Engineering and Information technology, Shivshail, Karai, Shiroda – Goa, India (e-mail: abhay_bhamaikar@rediffmail.com).
Pralhad Ramchandra Rao is with the Department of Computer Science and Technology, Goa University, India.


Cite:Abhay A. Bhamaikar and Pralhad Ramchandra Rao, "Identifying Dominating Graphs over Vertex Connectivity and Order Constraint in a Social Network," International Journal of Information and Education Technology vol. 3, no. 5, pp. 554-559, 2013.

Copyright © 2008-2018. International Journal of Information and Education Technology. All rights reserved.
E-mail: ijiet@ejournal.net