IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i4idhcseit1172492.html

Algorithm for 2-Vertex Connectivity in Directed Graphs

Author

Listed:
  • T Manohar Reddy

Abstract

Graph theory is very important in solving many problems efficiently. Each graph is made up of vertices and edges. Common notation used to represent a graph is G = (V, E) where V is a set of vertices and E is a set of edges. The dynamics of graphs were understood and explored well in the literature while there is insufficient research related to directed graphs. There are many problems to be solved with respect to graphs. For instance, 2-vertex connectivity is an important problem to be addressed. Recently Georgiadis et al. focused on this problem and found that two vertices v and w are 2-vertex connected when there are two internally vertex -disjoint paths coming from v to w and two internally vertex disjoint paths from w to v. Many kinds of combinations were explored in their work. However, it is useful to have more investigation on this. In this paper we reviewed directed graphs with 2-vertex connectivity with some algorithms. Our study reviewed that the approaches can be used effectively to solve select problems in the real world.

Suggested Citation

  • T Manohar Reddy, 2017. "Algorithm for 2-Vertex Connectivity in Directed Graphs," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(4), pages 875-879, September.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i4:id:hcseit1172492
    Note: Article URL: https://ijsrcseit.com/CSEIT1172492
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1172492
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT1172492.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i4:id:hcseit1172492. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.