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...
Guardado en:
Autores principales: | Mathew,Sunil, Sunitha,M. S |
---|---|
Lenguaje: | English |
Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2011
|
Materias: | |
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!
|
Ejemplares similares
-
Partial trees in weighted graphs-I
por: Mathew,Sunil
Publicado: (2011) -
Energy of strongly connected digraphs whose underlying graph is a cycle
por: Monsalve,Juan, et al.
Publicado: (2016) -
Algorithms for Finding Diameter Cycles of Biconnected Graphs
por: Mehmet Hakan Karaata
Publicado: (2020) -
Odd harmonious labeling of some cycle related graphs
por: Jeyanthi,P., et al.
Publicado: (2016) -
On star coloring of degree splitting of join graphs
por: Ulagammal,S., et al.
Publicado: (2019)