Uniformly least reliable graphs. - Louis Petingi; John T. Saccoman; Laura Schoppmann (Networks, 1996)

Generalized Edge-Toughness. - Louis Petingi; José Rodríguez (SCCC, 1997)

On the characterization of graphs with maximum number of spanning trees. - Louis Petingi; Frank Boesch; Charles L. Suffel (Discret. Math., 1998)

A new technique for the characterization of graphs with a maximum number of spanning trees. - Louis Petingi; José Rodríguez (Discret. Math., 2002)

Domination Invariant of a Diameter Constrained Network Reliability Model. - Héctor Cancela 001; Louis Petingi (Electron. Notes Discret. Math., 2004)

Reliability of communication networks with delay constraints: computational complexity and complete topologies. - Héctor Cancela 001; Louis Petingi (Int. J. Math. Math. Sci., 2004)

On the characterization of the domination of a diameter-constrained network reliability model. - Héctor Cancela 001; Louis Petingi (Discret. Appl. Math., 2006)

Packing the Steiner trees of a graph. - Louis Petingi; M. Talafha (Networks, 2009)

Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network. - Héctor Cancela 001; Mohamed El Khadiri; Louis Petingi (IEEE Trans. Reliab., 2011)

Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots. - Louis Petingi; Tamar Schlick (AlCoB, 2019)