The stress of a graph

Raksha Poojary; Arathi K. Bhat; S. Arumugam; Manjunatha Prasad Karantha

doi:10.22049/CCO.2021.27320.1231

The stress of a graph

Raksha Poojary
, Arathi K. Bhat
, S. Arumugam^*
, Manjunatha Prasad Karantha

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

Abstract

Stress is an important centrality measure of graphs applicable to the study of social and biological networks. We study the stress of paths, cycles, fans and wheels. We determine the stress of a cut vertex of a graph G, when G has at most two cut vertices. We have also identified the graphs with minimum stress and maximum stress in the family of all trees of order n and in the family of all complete bipartite graphs of order n.

Original language	English
Pages (from-to)	53-65
Number of pages	13
Journal	Communications in Combinatorics and Optimization
Volume	8
Issue number	1
DOIs	https://doi.org/10.22049/CCO.2021.27320.1231
Publication status	Published - 2023

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Control and Optimization

Access to Document

10.22049/CCO.2021.27320.1231

Cite this

@article{e22cd4782a5d44d9b12863acdabe15bf,

title = "The stress of a graph",

abstract = "Stress is an important centrality measure of graphs applicable to the study of social and biological networks. We study the stress of paths, cycles, fans and wheels. We determine the stress of a cut vertex of a graph G, when G has at most two cut vertices. We have also identified the graphs with minimum stress and maximum stress in the family of all trees of order n and in the family of all complete bipartite graphs of order n.",

author = "Raksha Poojary and Bhat, \{Arathi K.\} and S. Arumugam and Karantha, \{Manjunatha Prasad\}",

note = "Funding Information: Manjunatha Prasad Karantha acknowledges the support by Science and Engineering Research Board (DST, Government of India) under MATRICS (MTR/2018/000156) and CRG (CRG/2019/000238) schemes. The authors are thankful to the anonymous reviewers for their suggestions and comments which resulted in substantial improvement in the paper. Publisher Copyright: {\textcopyright} 2023 Azarbaijan Shahid Madani University.",

year = "2023",

doi = "10.22049/CCO.2021.27320.1231",

language = "English",

volume = "8",

pages = "53--65",

journal = "Communications in Combinatorics and Optimization",

issn = "2538-2128",

publisher = "Azarbaijan Shahid Madani University",

number = "1",

}

TY - JOUR

T1 - The stress of a graph

AU - Poojary, Raksha

AU - Bhat, Arathi K.

AU - Arumugam, S.

AU - Karantha, Manjunatha Prasad

N1 - Funding Information: Manjunatha Prasad Karantha acknowledges the support by Science and Engineering Research Board (DST, Government of India) under MATRICS (MTR/2018/000156) and CRG (CRG/2019/000238) schemes. The authors are thankful to the anonymous reviewers for their suggestions and comments which resulted in substantial improvement in the paper. Publisher Copyright: © 2023 Azarbaijan Shahid Madani University.

PY - 2023

Y1 - 2023

N2 - Stress is an important centrality measure of graphs applicable to the study of social and biological networks. We study the stress of paths, cycles, fans and wheels. We determine the stress of a cut vertex of a graph G, when G has at most two cut vertices. We have also identified the graphs with minimum stress and maximum stress in the family of all trees of order n and in the family of all complete bipartite graphs of order n.

AB - Stress is an important centrality measure of graphs applicable to the study of social and biological networks. We study the stress of paths, cycles, fans and wheels. We determine the stress of a cut vertex of a graph G, when G has at most two cut vertices. We have also identified the graphs with minimum stress and maximum stress in the family of all trees of order n and in the family of all complete bipartite graphs of order n.

UR - https://www.scopus.com/pages/publications/85136592628

UR - https://www.scopus.com/pages/publications/85136592628#tab=citedBy

U2 - 10.22049/CCO.2021.27320.1231

DO - 10.22049/CCO.2021.27320.1231

M3 - Article

AN - SCOPUS:85136592628

SN - 2538-2128

VL - 8

SP - 53

EP - 65

JO - Communications in Combinatorics and Optimization

JF - Communications in Combinatorics and Optimization

IS - 1

ER -

The stress of a graph

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this