IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v4y2002i2d10.1023_a1020689507456.html
   My bibliography  Save this article

Accessibility and Reliability for Connected Bipartite Graphs

Author

Listed:
  • Y. Ath

    (California State University, Dominguez Hills)

  • M. Ebneshahrashoob

    (California State University)

  • T. Gao

    (California State University)

  • M. Sobel

    (University of California)

Abstract

In the recently published atlas of graphs [9] the general listing of graphs with diagrams went up to V=7 vertices but the special listing for connected bipartite graphs carried further up to V=8. In this paper we wish to study the random accessibility of these connected bipartite graphs by means of random walks on the graphs using the degree of the “gratis” starting point as a weighting factor. The accessibility is then related to the concept of reliability of the graphs with only edge failures. Exact expectation results for accessibility are given for any complete connected bipartite graph N1 cbp N2 (where “cbp” denotes “connected bipartite”) for several values of J (the number of new vertices searched for). The main conjecture in this paper is that for any complete connected bipartite graph N1 cbp N2: if |N1−N2| ≤ 1, then the graph is both uniformly optimal in reliability and optimal in random accessibility within its family. Numerical results are provided to support the conjecture.

Suggested Citation

  • Y. Ath & M. Ebneshahrashoob & T. Gao & M. Sobel, 2002. "Accessibility and Reliability for Connected Bipartite Graphs," Methodology and Computing in Applied Probability, Springer, vol. 4(2), pages 153-161, June.
    • Handle: RePEc:spr:metcap:v:4:y:2002:i:2:d:10.1023_a:1020689507456
    DOI: 10.1023/A:1020689507456
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1020689507456
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1020689507456?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:metcap:v:4:y:2002:i:2:d:10.1023_a:1020689507456. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.