My Research Visiting Card in Hamiltonian Graph Theory

MaRDI QIDQ6232212zbMATH OpenFDO

Authors Zh. G. Nikoghosyan

Publication date 9 April 2012

Abstract: We present eighteen exact analogs of six well-known fundamental Theorems (due to Dirac, Nash-Williams and Jung) in hamiltonian graph theory providing alternative compositions of graph invariants. In Theorems 1-3 we give three lower bounds for the length of a longest cycle $C$ of a graph $G$ in terms of minimum degree $delta$, connectivity $kappa$ and parameters $$, $$ - the lengths of a longest path and longest cycle in $$, respectively. These bounds have no analogs in the area involving $$ and $$ as parameters. In Theorems 11 and 12 we give two Dirac-type results for generalized cycles including a number of fundamental results (concerning Hamilton and dominating cycles) as special cases. Connectivity invariant $kappa$ appears as a parameter in some fundamental results and in some their exact analogs (Theorems 3-10) in the following chronological order: 1972 (Chv'{a}tal and Erd"{o}s), 1981a (Nikoghosyan), 1981b (Nikoghosyan), 1985a (Nikoghosyan), 1985b (Nikoghosyan), 2000 (Nikoghosyan), 2005 (Lu, Liu, Tian), 2009 (Nikoghosyan), 2009a (Yamashita), 2009b (Yamashita), 2011a (Nikoghosyan), 2011b (Nikoghosyan).

This page was built for publication: My Research Visiting Card in Hamiltonian Graph Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232212)