TOTAL VERTEX STRESS ALTERATION IN CYCLE RELATED GRAPHS

Authors

  • Johan Kok Christ University image/svg+xml , Independent Mathematics Researcher, City of Tshwane, South Africa Author
  • Joseph Shiny Govt. College Mananthavady image/svg+xml Author
  • V. Ajitha Mahatma Gandhi College, Iritty, Kerala, India Author

DOI:

https://doi.org/10.37560/matbil2020149k

Keywords:

Vertex stress, average vertex stress, total vertex stress

Abstract

In the main this paper discusses the addition of an edge \(uv \in E(\overline{G})\) to a cycle graph \(C_n\) to obtain the 1-chorded cycle graph \(C_n^{\sim 1}\) such that the total vertex stress of \(C_n^{\sim 1}\) compared to the total vertex stress of \(C_n\) shows a maximum or minimum alteration over all \(uv \in E(\overline{G})\). Furthermore, results for wheel graphs, helm graphs, flower graphs, sunlet graphs, sun graphs and prism graphs are also presented. Finally a heuristic algorithm is proposed which determines the total vertex stress in a general graph \(G\).

Downloads

Published

2021-02-04

Issue

Vol. 44 No. 2 (2020): 44 (LXX) 2 (2020)

Section

Articles

License

Copyright (c) 2020 Matematichki Bilten

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
J. Kok, J. Shiny, and V. Ajitha, “TOTAL VERTEX STRESS ALTERATION IN CYCLE RELATED GRAPHS”, Mat. Bilt., vol. 44, no. 2, pp. 149–162, Feb. 2021, doi: 10.37560/matbil2020149k.