Stress centrality of some graph operations

DOI10.1142/S1793557125501463MaRDI QIDQ7253218zbMATH OpenFDO

Authors Niveditha, K. Arathi Bhat, Shahistha Hanif

Publication date 27 May 2026

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1142/S1793557125501463

zbMATH Keywords

Mycielski graphquality educationshadow graphshortest pathsplitting graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• Stress of a graph and its computation
• Sur le coloriage des graphs
• The stress of a graph
• Towards a characterization of graphs with distinct betweenness centralities

This page was built for publication: Stress centrality of some graph operations

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