| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427642 | Information Processing Letters | 2012 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
