4 papers
The Palindromic Trees
Tadashi Akagi, Eduardo A. Canale
The family of trees with palindromic characteristic polynomials is characterized. Large families of graphs with this property are found as well.
Counterexample to a Boesch's Conjecture
Nicole Rosenstock, Eduardo A. Canale
A key issue in network reliability analysis. A graph with nodes and whose edges fail independently with probability is an \emph{Uniformly Most Reliable Graph} (UMRG) if…
From weighted to unweighted graphs in Synchronizing Graph Theory
Eduardo A. Canale
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e.,…
Tromino Tilings with Pegs via Flow Networks
Javier T. Akagi, Eduardo A. Canale, Marcos Villagra
A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using tromin…