Necessary and sufficient condition for Maximal uniquely Hamiltonian graph.

Autor:	Nhu, An D., Dinh, Hoa V.
Předmět:	HAMILTONIAN graph theory POLYNOMIAL time algorithms GRAPH theory ALGORITHMS
Zdroj:	International Journal of Advanced Research in Computer Science; Sep/Oct2012, Vol. 3 Issue 5, p114-117, 4p
Abstrakt:	A graph is called a maximal uniquely Hamiltonian graph if it has the maximum number of edges among the graphs with the same number of vertices and exact one Hamiltonian cycle. In this paper we present a necessary and sufficient condition for Maximal uniquely Hamiltonian graph and propose a polynomial time algorithm to recognize the maximal uniquely Hamiltonian graph. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu