Cycle connectivity in weighted graphs
Keywords:Weighted graph, Partial cutnode, Partial bridge, Strong cycle, Cycle connectivity.
Some new connectivity concepts in weighted graphs are introduced in this article. The concepts of strong arc, partial cutnode, bridge and block are introduced. Also three different types of cycles namely locamin cycle, multimin cycle and strongest strong cycle are introduced. Partial blocks in weighted graphs are characterized using strongest paths. Also a set of necessary conditions for a weighted graph to be a partial block involving strong cycles and a sufficient condition for a weighted graph to be a partial block involving strongest strong cycles are obtained. A new connectivity parameter called cycle connectivity and a new type of weighted graphs called θ - weighted graphs are introduced and partial blocks in θ - weighted graphs are fully characterized.
 J. A. Bondy, G. Fan, Cycles in weighted graphs, Combinatorica 11, pp. 191-205, (1991).
 R. Diestel, Graph Theory, Second edition, Graduate texts in mathematics 173, Springer, (2000).
 G. A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. (3) 2, pp. 69 - 81, (1952).
 M. Grotschel, Graphs with cycles containing given paths, Ann. Discrete Math. 1, pp. 233 - 245, (1977).
 Sunil Mathew, M. S. Sunitha, Types of arcs in a fuzzy graph, Information Sciences 179 (11)1, pp. 1760-1768, (2009).
 Sunil Mathew, M. S. Sunitha, Some connectivity concepts in weighted graphs, Advances and Applications in Discrete Mathematics 6 (1), pp. 45-54, (2010).
 Sunil Mathew, M. S. Sunitha, Bonds in graphs and fuzzy graphs,Advances in Fuzzy Sets and Systems, 6 (2), pp. 107-119, (2010).
 S. Zang, X. Li, H. Broersma, Heavy paths and cycles in weighted graphs, Discrete Math. 223, pp. 327-336, (2000).