A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
For a graph G(V (G), E(G)), the set Z ⊆ V (G) is called a k-geodetic propagation set if Z is both a k-geodetic set as well as a propagating set. The cardinality of the minimum k-geodetic propagation set is called the k-geodetic propagation number. Few general results and also the computational complexity part of this concept for general,bipartite and chordal graphs are derived.doi:10.26637/mjm0s20/0002 fatcat:dxneuroucbhnflxljpdfq2debi