Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(19 citation statements)
references
References 10 publications
0
19
0
Order By: Relevance
“…Since the fundamental work of Delsarte [8], a great amount of work on perfect codes in distance-regular graphs and association schemes in general has been produced. Beginning with [22], perfect codes in general graphs have also attracted considerable attention in the community of graph theory; see [21,26,27,30,35,41] for example.…”
Section: Introductionmentioning
confidence: 99%
“…Since the fundamental work of Delsarte [8], a great amount of work on perfect codes in distance-regular graphs and association schemes in general has been produced. Beginning with [22], perfect codes in general graphs have also attracted considerable attention in the community of graph theory; see [21,26,27,30,35,41] for example.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, an r-perfect code of the direct product of two cycles is uniquely determined by two vertices (on each connected component) and these are the only perfect codes that exist. We only mention here that this result can be generalized to a product of any finite number of factors [14].…”
Section: Tablementioning
confidence: 94%
“…The concept has applications in game theory and frequency assignment [11,4]. Perfect codes of direct product graphs and in particular, perfect codes in products of cycles were studied recently [7][8][9][10]14]. In this paper, we study existence of perfect codes in direct graph bundles of cycles over cycles and provide a complete solution.…”
Section: Introductionmentioning
confidence: 96%
“…The reason for this is hidden in (3) because we are limited with the vertices of the product. Another motivation is that ECD graphs among the direct product of graphs was a hard task and was settled completely in three papers, see [14,17,35]. We will solve this more elegant for directed cycles due to an old result about the structure of the direct product of digraphs.…”
Section: Direct Productmentioning
confidence: 99%