On Eulerian orientations of even-degree hypercubes期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On Eulerian orientations of even-degree hypercubes

Authors:	Maxwell Levit L. Sunil Chandran Joseph Cheriyan

Affiliation:	1. C&O Department, University of Waterloo, Waterloo, ON, Canada N2L 3G1;2. Computer Science and Automation Department, Indian Institute of Science, Bangalore, India

Abstract:	It is well known that every Eulerian orientation of an Eulerian $2 k$ -edge connected (undirected) graph is strongly $k$ -edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, such as node connectivity. We show that every Eulerian orientation of the hypercube of degree $2 k$ is strongly $k$ -node connected.

Keywords:	Graph connectivity Graph orientations Hypercubes
本文献已被 ScienceDirect 等数据库收录！