Zobrazeno 1 - 2
of 2
pro vyhledávání: '"陳玉專"'
Autor:
Y-Chuang Chen, 陳玉專
92
Let $G=(V,E)$ be a $k$-regular graph with connectivity $\kappa$ and edge connectivity $\lambda$. $G$ is {\it maximum connected} if $\kappa = k$, and $G$ is {\it maximum edge connected} if $\lambda = k$. Moreover, $G$ is {\it super-connected}
Let $G=(V,E)$ be a $k$-regular graph with connectivity $\kappa$ and edge connectivity $\lambda$. $G$ is {\it maximum connected} if $\kappa = k$, and $G$ is {\it maximum edge connected} if $\lambda = k$. Moreover, $G$ is {\it super-connected}
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/12091205514815959862
Autor:
Y-Chuang Chen, 陳玉專
88
A k-regular graph G is hamiltonian decomposable if its edge-set can be partitioned into k/2 hamiltonian cycles when k is even or (k-1)/2 hamiltonian cycles and a perfect matching when k is odd. In this paper, we prove that every recursive cir
A k-regular graph G is hamiltonian decomposable if its edge-set can be partitioned into k/2 hamiltonian cycles when k is even or (k-1)/2 hamiltonian cycles and a perfect matching when k is odd. In this paper, we prove that every recursive cir
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/26045657867042044696