loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
Cages: constructions and new upper bounds
Las Vegas, Nevada, USA
December 07-December 09
ISBN: 0-7695-2509-1
ASCII Text
x 
 
Gabriela Araujo-Pardo, Juan Jose Montellano-Ballesteros, "Cages: constructions and new upper bounds," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 472-477, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2005.23,
author = {Gabriela Araujo-Pardo and Juan Jose Montellano-Ballesteros},
title = {Cages: constructions and new upper bounds},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2005},
issn = {1087-4089},
pages = {472-477},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2005.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Cages: constructions and new upper bounds
SN - 1087-4089
SP472
EP477
A1 - Gabriela Araujo-Pardo,
A1 - Juan Jose Montellano-Ballesteros,
PY - 2005
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Gabriela Araujo-Pardo, Instituto de Matematicas, UNAM
Juan Jose Montellano-Ballesteros, Instituto de Matematicas, UNAM
In this paper some constructions of graphs are presented. These constructions give us the known upper bounds for (k, g)-cages when g \varepsilon {5, 6, 7, 8} and new upper bounds when g \varepsilon {11, 12} (see [1]). Besides, these constructions improve the bounds for g = 5, and for g \varepsilon {7, 11} with k -1 = 2\alpha.
Citation:
Gabriela Araujo-Pardo, Juan Jose Montellano-Ballesteros, "Cages: constructions and new upper bounds," ispan, pp.472-477, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.