The Upper Monophonic Number Of A Graph

J.John, S.Panchali
2010 Zenodo  
For a connected graph G = (V,E), a Smarandachely k-monophonic set of G is a set M ⊆ V (G) such that every vertex of G is contained in a path with less or equal k chords joining some pair of vertices in M.
doi:10.5281/zenodo.825483 fatcat:c62hjfft25au7adbyrdqslonxe