Louis Petingi

11 papers C 1Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2025 C conf
Construction of infinitely many trace-minimal graphs with maximum number of spanning trees.
LAGOS
Pablo Romero, Louis Petingi
2019 — conf
Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots.
AlCoB
Louis Petingi, Tamar Schlick
2011 J jnl
Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network.
IEEE Trans. Reliab.
Héctor Cancela, Mohamed El Khadiri, Louis Petingi
2009 J jnl
Packing the Steiner trees of a graph.
Networks
Louis Petingi, M. Talafha
2006 J jnl
On the characterization of the domination of a diameter-constrained network reliability model.
Discret. Appl. Math.
Héctor Cancela, Louis Petingi
2004 J jnl
Domination Invariant of a Diameter Constrained Network Reliability Model.
Electron. Notes Discret. Math.
Héctor Cancela, Louis Petingi
2004 J jnl
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Int. J. Math. Math. Sci.
Héctor Cancela, Louis Petingi
2002 J jnl
A new technique for the characterization of graphs with a maximum number of spanning trees.
Discret. Math.
Louis Petingi, José Rodríguez
1998 J jnl
On the characterization of graphs with maximum number of spanning trees.
Discret. Math.
Louis Petingi, Frank Boesch, Charles L. Suffel
1997 — conf
Generalized Edge-Toughness.
SCCC
Louis Petingi, José Rodríguez
1996 J jnl
Uniformly least reliable graphs.
Networks
Louis Petingi, John T. Saccoman, Laura Schoppmann