Some strong adjacency problems in weighted graphs
Darshan Lal M Nair, Sunil Mathew · Journal of Uncertainty in Mathematics Science · 2014
In this paper, the concepts of strong k-container and strong spanning container are introduced. Strongly spanning connected weighted graphs are defined using these concepts. Strongly spanning connected graphs of partial trees, weighted cycles and partial blocks are discussed. Also strongly bipartite graphs are defined and characterized.