Abstract

In this paper, some lower and upper bounds for the subgraph centrality and communicability of a graph are proved. The expected value of the normalized total communicability of a random G(n,p) graph is also considered and asymptotically determined. Moreover, some computational results are presented to compare the bounds obtained in this paper with some other bounds in the literature.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call