Please use this identifier to cite or link to this item:
http://ri2.bib.udo.edu.ve:8080/jspui/handle/123456789/3873| Title: | ÁRBOL INDEPENDIENTE EN GRAFOS BIPARTITOS BALANCEADOS |
| Authors: | Marín, Lope (lmata@udo.edu.ve) Brito, Daniel (dbrito@udo.edu.ve) Lárez, Gladys (glarez@udo.edu.ve) |
| Keywords: | árbol independiente mínimo grado grafo bipartito grafo hamiltoniano independence trees minimum degree bipartite graph hamiltonian graph |
| Issue Date: | Jun-2006 |
| Publisher: | Universidad de Oriente |
| Abstract: | RESUMEN: Sea G un grafo bipartito balanceado de orden 2n y mínimo grado δ . En este artículo se prueba que la condición α B T (G)≤δ(G)-1 implica que G es hamiltoniano. ABSTRACT: Let G be a balanced bipartite graph of order 2n and minimum degree δ. It is proven in this paper that the condition α B T (G)≤δ(G)-1 implies that G is Hamiltonian. T (G)≤δ(G)-1 implica que G es hamiltoniano |
| URI: | http://ri2.bib.udo.edu.ve:8080/jspui/handle/123456789/3873 |
| ISSN: | 1315-0162 |
| Appears in Collections: | Revista SABER - Vol. 18 - Nros. 1 y 2 del año 2006 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Arbol Independiente en Grafos Bipartitos Balanceados.pdf | 719,23 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Admin Tools