Cycle connectivity in weighted graphs

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 weigh...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Mathew,Sunil, Sunitha,M. S
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2011
Materias:	Weighted graph partial cutnode partial bridge strong cycle cycle connectivity
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172011000100001
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172011000100001
record_format	dspace
spelling	oai:scielo:S0716-091720110001000012018-10-30Cycle connectivity in weighted graphsMathew,SunilSunitha,M. S 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.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.30 n.1 20112011-01-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172011000100001en10.4067/S0716-09172011000100001
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Weighted graph partial cutnode partial bridge strong cycle cycle connectivity
spellingShingle	Weighted graph partial cutnode partial bridge strong cycle cycle connectivity Mathew,Sunil Sunitha,M. S Cycle connectivity in weighted graphs
description	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.
author	Mathew,Sunil Sunitha,M. S
author_facet	Mathew,Sunil Sunitha,M. S
author_sort	Mathew,Sunil
title	Cycle connectivity in weighted graphs
title_short	Cycle connectivity in weighted graphs
title_full	Cycle connectivity in weighted graphs
title_fullStr	Cycle connectivity in weighted graphs
title_full_unstemmed	Cycle connectivity in weighted graphs
title_sort	cycle connectivity in weighted graphs
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2011
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172011000100001
work_keys_str_mv	AT mathewsunil cycleconnectivityinweightedgraphs AT sunithams cycleconnectivityinweightedgraphs
_version_	1718439772361326592

Cycle connectivity in weighted graphs

Ejemplares similares