Stress of a graph and its computation

DOI10.1080/09728600.2023.2243630MaRDI QIDQ6085207zbMATH OpenOpenAlexFDO

Authors S. Arumugam, Manjunatha Prasad Karantha

Publication date 7 November 2023

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2023.2243630

zbMATH Keywords

adjacency matrixbetweennesscentrality measuredistance matrixstress

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The stress of a graph
• On embeddability and stresses of graphs
• Graph Drawing
• Total vertex stress alteration in cycle related graphs
• Total induced vertex stress in barbell-like graphs
• The Binary Stress Model for Graph Drawing
• Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing
• Computing the stretch of an embedded graph
• A universality theorem for stressable graphs in the plane
• Squares stress sum index for graphs

Cites work

• Betweenness centrality in Cartesian product of graphs
• Networks
• The stress of a graph
• Towards a characterization of graphs with distinct betweenness centralities

Cited in

(9)

• A universality theorem for stressable graphs in the plane
• Richness of a vertex in a graph
• Square root stress-sum index for graphs
• Squares stress sum index for graphs
• The stress of a graph
• Stress-difference index for graphs
• Stress centrality of some graph operations
• Stress centrality measure of a vertex
• On embeddability and stresses of graphs

This page was built for publication: Stress of a graph and its computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085207)