{"title":"完全对称有向图的有向七面体分解","authors":"Uğur Odabaşı","doi":"10.3906/mat-2007-54","DOIUrl":null,"url":null,"abstract":"The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair of distinct vertices $x$ and $y$. For a given directed graph, $D$, the set of all $v$ for which $K_{v}^*$ admits a $D$-decomposition is called the spectrum of $D$. There are 10 non-isomorphic orientations of a $7$-cycle (heptagon). In this paper, we completely settled the spectrum problem for each of the oriented heptagons.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"73 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Decompositions of complete symmetric directed graphs into the oriented heptagons\",\"authors\":\"Uğur Odabaşı\",\"doi\":\"10.3906/mat-2007-54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair of distinct vertices $x$ and $y$. For a given directed graph, $D$, the set of all $v$ for which $K_{v}^*$ admits a $D$-decomposition is called the spectrum of $D$. There are 10 non-isomorphic orientations of a $7$-cycle (heptagon). In this paper, we completely settled the spectrum problem for each of the oriented heptagons.\",\"PeriodicalId\":8442,\"journal\":{\"name\":\"arXiv: Combinatorics\",\"volume\":\"73 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3906/mat-2007-54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3906/mat-2007-54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decompositions of complete symmetric directed graphs into the oriented heptagons
The complete symmetric directed graph of order $v$, denoted $K_{v}^*$, is the directed graph on $v$ vertices that contains both arcs $(x,y)$ and $(y,x)$ for each pair of distinct vertices $x$ and $y$. For a given directed graph, $D$, the set of all $v$ for which $K_{v}^*$ admits a $D$-decomposition is called the spectrum of $D$. There are 10 non-isomorphic orientations of a $7$-cycle (heptagon). In this paper, we completely settled the spectrum problem for each of the oriented heptagons.