Contents

Ars Combinatoria

  • Research article

Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs

Tay-Woei Shyu1, Chiang Lin2
1Department of Banking and Finance Kai Nan University Lu-Chu, Tao-Yuan, Taiwan 338, R.O.C.
2Department of Mathematics National Central University Chung-Li, Taiwan 320, R.O.C.
  • Published: 31/10/2001

Abstract

A path in a digraph is antidirected if the two adjacent edges of the path have opposing orientations. In this paper, we give a necessary and sufficient condition for the edges of the complete symmetric graph to be decomposed into isomorphic antidirected paths.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Tay-Woei Shyu, Chiang Lin. Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs[J], Ars Combinatoria, Volume 061. 255-262. .