The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON MATHEMATICS
Transactions ID Number: 29-355
Full Name: Chang Hsiung Tsai
Position: Professor
Age: ON
Sex: Male
Address: No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 97401,Taiwan, R.O.C.
Country: TAIWAN
Tel:
Tel prefix:
Fax:
E-mail address: chtsai@mail.ndhu.edu.tw
Other E-mails: chtsai@mail.nhlue.edu.tw
Title of the Paper: embedding geodesic and balanced cycles into hypercubes
Authors as they appear in the Paper: Pao-Lien Lai, Chang-Hsiung Tsai, Hong-Chun Hsu
Email addresses of all the authors: baolein@mail.ndhu.edu.tw, chtsai@mail.ndhu.edu.tw,hchsu@mail.tcu.edu.tw
Number of paper pages: 10
Abstract: A graph $G$ is said to be {\it pancyclic} if it contains cycles of all lengths from $4$ to $ V(G) $ in $G$. For any two vertices $u,v\in V(G)$, a cycle is called a {\it geodesic cycle} with $u$ and $v$ if a shortest path joining $u$ and $v$ lies on the cycle. Let $G$ be a bipartite graph. For any two vertices $u$ and $v$ in $G$, a cycle $C$ is called a {\it balanced cycle} between $u$ and $v$ if $d_C(u,v)=max\{d_C(x,y)\mid$ $d_G(x,u)$ and $d_G(y,v)$ are even, resp. for all $x,y\in V(G)$ $\}$. A bipartite graph $G$ is {\it geodesic bipancyclic} (respectively, {\it balanced bipancyclic}) if for each pair of vertices $u,v\in V(G)$, it contains a geodesic cycle (respectively, balanced cycle) of every even length of $k$ satisfying $max\{2d_G(u,v),4\}\le k \le V(G) $ between $u$ and $v$. In this paper, we prove that $Q_n$ is geodesic bipancyclic and balanced bipancyclic if $n\ge 2$.
Keywords: Hypercube, Interconnection networks, Edge-bipancyclic, Geodesic bipancyclic, Balanced bipancyclic
EXTENSION of the file: .pdf
Special (Invited) Session: Geodesic and Balanced Bipancyclicity of Hypercubes
Organizer of the Session: 613-143
How Did you learn about congress:
IP ADDRESS: 220.132.50.218
