COMING UP

 

R. Barrera and D. Ferrero. Power domination in cylinders, tori and generalized Petersen graphs. Submitted to Networks.

D. Ferrero and F. Harary. The eccentricity sequence of a connected graph. Accepted for publication in the AKCE Int. J. Graphs and Combin.

J. Bagga, R. E. Ellis and D. Ferrero. The spectra of superline multigraph. Accepted for publication in the Ramanujan Mathematical Society Lectures Notes.

D. Ferrero. Path Graph Connectedness. Accepted for publication in the J. Combin. Math. Combin. Comput.

 

ARTICLES PUBLISHED

 

D. Ferrero, T-Y. Ho, T-Y. Sung and J-J. Wang. Diameter variability of cycles and tori. Information Sciences 178, 14 (2008) 2960-2967 . pdf

D. Ferrero. Product Line Sigraphs. IEEE Proc. Int. Symposium on Parallel Architectures, Algortihms and Networks, ISPAN'08 (2008) 141-145. pdf

D. Ferrero and S. Vasquez. Advanced Mathematics Research Experiences for High School Students.  Texas College Math. J., Vol. 4, no. 1, (2007)1-12. pdf

D. Ferrero. Super line digraphs. IEEE Proc.  Int. Conference on Information Technology: New Generations, ITNG (2007). pdf

J. Bagga and D. Ferrero. The structure of super line graphs. IEEE Proc.  Int. Symposium on Parallel Architectures, Algorithms and Networks, ISPAN'05 (2005), 468-471. pdf

S. Durdan, D. Ferrero and F. Harary. The evolution of square cell animals. Chance Vol. 18 No. 3 (2005), 16-19.

C. Balbuena, D. Ferrero and X. Marcote. Diameter vulnerability of line digraphs in terms of the girth. Networks 45 (2005), no. 2, 49-54.  pdf

H. Chung, D. Ferrero, A. Taylor and J. Warshauer. Diameter of Path Graphs.  Journal of Discrete Mathematical Sciences & Cryptography, Vol.7, No.1 (2004) 49-54.

C. Balbuena, D. Ferrero, X. Marcote and I. Pelayo. Algebraic properties of line digraphs. Journal of Interconnection Networks, Vol.4, No. 4, (2003) 373-393.

D. Ferrero. Connectivity of Path Graphs.  Acta Mathematica Universitatis Comenianae, Vol. LXXII No.1 (2003) 59-66. pdf

C. Balbuena and D. Ferrero. Connectivity and Super-Connectivity of P₂ path graphs. Discrete Mathematics, 269, 1-3 (2003) 13-20 pdf

D. Ferrero and F. Harary. Edge sums of deBruijn interconnection networks. Int. Journal of Computer Mathematics, Vol. 80 No. 7 (2003) 819-124. pdf

C. Chi, D. Ferrero, C. Hallford and R. Williams. On the edge sums of deBruijn graphs. Journal of Discrete Mathematical Sciences & Cryptography ,  Vol.5, No.2 (2002) 105-117.

D. Ferrero, Edge Connectivity of Iterated P₃ Path Graphs, Congressus Numerantium 155 (2002) 33-47.

D. Ferrero and C. Padró. Partial line directed hypergraphs. Networks 39/2 (2002) 61-67. pdf

D. Ferrero and C. Padró. Connectivity and fault-tolerance of hyperdigraphs. Discrete Applied Mathematics 117 (2002) 15-26.  pdf

D. Ferrero.  Fault Tolerance in Digraphs of Small Diameter. Proc. 6^th World Multiconference on Systemics, Cybernetics and Informatics. Orlando, FL (2002).

D. Ferrero and C. Padró. New bounds on the diameter vulnerability of iterated line digraphs. Discrete Mathematics 233, 1-3 (2001) 103-113. pdf

D. Ferrero and C. Padró.  Disjoint paths of bounded length in large generalized cycles. Discrete Mathematics 197-198 (1999) 285-298.  pdf

D. Ferrero. Introduction to interconnection network models. Publicaciones Matematicas del Uruguay, 99/25, (1999).  ps

D. Ferrero. Connectivity in Directed Hypergraphs.  Connectivity in directed hypergraphs. Information Technology (1999) 637-641.

D. Ferrero. A Technique for the (d, s, N)-Bus Network Problem. IEEE Proc. XIX Int. Conf. Chilean Computer Science Society, SCCC'99. pdf  

D. Ferrero. Maximally Connected Hyperdigraphs. Paul Erdös and his mathematics (Budapest, 1999) 62-64, János Bolyai Math. Soc., Budapest, 1999.

C. Balbuena and D. Ferrero. Conditional diameter vulnerability of iterated line digraphs. I Jornades de Matematica Discreta y Algorismica, Barcelona,1998.

D. Ferrero and C. Padró. New bounds on the diameter-vulnerability of iterated line-digraphs.  I Jornades de Matematica Discreta y Algorismica, Barcelona, 1998.

D. Ferrero, R. Gonzalo and  M. Soriano. Some Properties of Non Linear Feedback Shift Registers with Maximum Period. Proc. Sixth Int. Conf. Telecommunications Systems. Nashville, TN, 1998. article

 D. Ferrero,  M. Soriano and R. Gonzalo. NLFSR de período máximo. Proc. V Reunión Española de Criptografía y Seguridad de la Información. Málaga, Spain; 1998.

D. Ferrero and C. Padró. Fault Tolerant Routings in Large Generalized Cycles. IEEE Proc. XVI Int. Conf. Chilean Computer Science Society, SCCC'97.  pdf

D. Ferrero and  M. Soriano. Non Linear Feedback Shift Registers over Zn. Research Conference On Algebra and Discrete Mathematics of the European Mathematical Society. San Feliu de Guixols, Spain,1997.

 

Back