IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/4678415.html
   My bibliography  Save this article

Stress in Directed Graphs: A Generalization of Graph Stress

Author

Listed:
  • K. V. Madhumitha
  • A. Harshitha
  • Swati Nayak
  • Sabitha D’Souza

Abstract

In graph theory, centrality measures are used to identify the most important or influential nodes within a network. Stress centrality is one such measure, which helps quantify how “stressed†a node is within the overall graph structure based on the number of shortest paths that pass through it. Stress centrality provides a more thorough assessment of a node’s relevance than other centrality metrics since it considers not only the direct connections of a node but also the indirect effects through its neighboring nodes. Furthermore, stress centrality can be applied to biological, technical, and social networks, among other kinds of networks. The idea of stress has been expanded from undirected graphs to directed graphs in our study. The stress on a vertex v in D is half of the number of geodesics passing through the vertex v, denoted by stv. This definition reduces to the case of stress of undirected graph whenever the digraph is symmetric. We have some findings on the stress on a digraph as well as the stress on a vertex. A few standard digraphs’ stresses are obtained, including the stress on any vertex in the cartesian product of digraphs, and some characterization on stress regular digraphs is made.

Suggested Citation

  • K. V. Madhumitha & A. Harshitha & Swati Nayak & Sabitha D’Souza, 2025. "Stress in Directed Graphs: A Generalization of Graph Stress," Journal of Applied Mathematics, Hindawi, vol. 2025, pages 1-8, February.
  • Handle: RePEc:hin:jnljam:4678415
    DOI: 10.1155/jama/4678415
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/jam/2025/4678415.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/jam/2025/4678415.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/jama/4678415?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
    ---><---

    More about this item

    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:hin:jnljam:4678415. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.