Sciweavers

EJC
2007
14 years 17 days ago
Nonsingular mixed graphs with few eigenvalues greater than two
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
Yi-Zheng Fan, Shi-Cai Gong, Jun Zhou, Ying-Ying Ta...
COR
2006
94views more  COR 2006»
14 years 19 days ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...