A characterization of partial blocks in weighted graphs

Authors:
Sunil Mathew;M. S. Sunitha
Affiliations:
Department of Mathematics, National Institute of Technology, Calicut 670 601, India;Department of Mathematics, National Institute of Technology, Calicut 670 601, India
Venue:
Information Processing Letters
Year:
2012

Citing 3
Cited 0

Heavy paths and cycles in weighted graphs

Discrete Mathematics
Types of arcs in a fuzzy graph

Information Sciences: an International Journal
Node connectivity and arc connectivity of a fuzzy graph

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

Some of the classical connectivity concepts in Graph theory are generalized in this article. Strong and strongest strong cycles are introduced. Partial blocks are characterized using strongest paths. Some necessary and sufficient conditions for a weighted graph to be a partial block are also presented.