Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs

Tay Woei Shyu; Chiang Lin

Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs

Tay Woei Shyu^*
, Chiang Lin

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	255-262
Number of pages	8
Journal	Ars Combinatoria
Volume	61
Publication status	Published - 2001
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Cite this

@article{e2f783d6e10043a9b8f88b725f2722c2,

title = "Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs",

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.",

author = "Shyu, \{Tay Woei\} and Chiang Lin",

year = "2001",

language = "English",

volume = "61",

pages = "255--262",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs

AU - Shyu, Tay Woei

AU - Lin, Chiang

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0348238536

UR - https://www.scopus.com/pages/publications/0348238536#tab=citedBy

M3 - Article

AN - SCOPUS:0348238536

SN - 0381-7032

VL - 61

SP - 255

EP - 262

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this