Show simple item record

dc.creatorMathew, Sunil
dc.creatorSunitha, M. S.
dc.date2011-05-25
dc.date.accessioned2019-11-14T11:58:52Z
dc.date.available2019-11-14T11:58:52Z
dc.identifierhttps://www.revistaproyecciones.cl/article/view/1-17
dc.identifier10.4067/S0716-09172011000100001
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/112972
dc.descriptionSome 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.es-ES
dc.formatapplication/pdf
dc.languagespa
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttps://www.revistaproyecciones.cl/article/view/1-17/pdf
dc.rightsDerechos de autor 2011 Proyecciones. Journal of Mathematicses-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 30 No 1 (2011); 1-17en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 30 Núm. 1 (2011); 1-17es-ES
dc.source0717-6279
dc.source0716-0917
dc.subjectWeighted graphes-ES
dc.subjectPartial cutnodees-ES
dc.subjectPartial bridgees-ES
dc.subjectStrong cyclees-ES
dc.subjectCycle connectivity.es-ES
dc.titleCycle connectivity in weighted graphses-ES
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record