Determinants and Longest Cycles of Graphs

DOI10.1137/070693898zbMath1175.05075OpenAlexW2085655310MaRDI QIDQ3394999

Giang T. Nguyen, Walter Murray, Vladimir V. Ežov, Jerzy A. Filar

Publication date: 20 August 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://unisa.alma.exlibrisgroup.com/view/delivery/61USOUTHAUS_INST/12143151420001831

zbMATH Keywords

Markov chainsHamiltonian cycletransition matrix

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Matrices of integers (15B36) Eulerian and Hamiltonian graphs (05C45) Stochastic matrices (15B51) Matrices, determinants in number theory (11C20)

Related Items (11)

On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph ⋮ Hamiltonian Cycles and Subsets of Discounted Occupational Measures ⋮ The longest cycle problem is polynomial on interval graphs ⋮ A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem ⋮ Consistent behavior of certain perturbed determinants induced by graphs ⋮ Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem ⋮ Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains ⋮ On the fastest finite Markov processes ⋮ Hamiltonian cycle curves in the space of discounted occupational measures ⋮ The Buck-Passing Game ⋮ Feasible Bases for a Polytope Related to the Hamilton Cycle Problem

This page was built for publication: Determinants and Longest Cycles of Graphs