The parametrized algorithm for Hamiltonian matrices.
Faßbender, H. (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Faßbender, H. (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Benner, Peter, Fassbender, Heike, Stoll, Martin (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Ammar, Gregory, Benner, Peter, Mehrmann, Volker (1993)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Mehrmann, Volker, Watkins, David (2002)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Mehrmann, Volker, Xu, Hongguo (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Watkins, David S. (2006)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Benner, Peter, Byers, Ralph, Fassbender, Heike, Mehrmann, Volker, Watkins, David (2000)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity:
Rodman, Leiba (2008)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
E. Zenhder (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Brown, B. M., Evans, W. D., Marletta, M. (1999)
Journal of Inequalities and Applications [electronic only]
Similarity:
Gary Chartrand, S. F. Kapoor (1974)
Colloquium Mathematicae
Similarity:
Salam, A., Watkins, D.S. (2011)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Jens-P. Bode, Anika Fricke, Arnfried Kemnitz (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity...