Autor:	Hou, Xinmin, Liu, Bolian, Wang, Tianming
Předmět:	ALGORITHMS ALGEBRA FOUNDATIONS of arithmetic MATHEMATICS DIAMETER LOGIC
Zdroj:	Graphs & Combinatorics; Mar2003, Vol. 19 Issue 1, p111-119, 9p
Abstrakt:	Let f(2m,k) be the Maximum k-diameter of k-regular k-connected graphs on 2m vertices. In this paper we give an algorithm and prove that we can construct k-regular k-connected graphs on 2m vertices with the maximum k-diameter using it. We also prove some known results about f(2m,k) and verify that we can get some unknown values of f(2m,k) by our algorithm. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink