DOI QR코드

DOI QR Code

HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5

  • Bouaziz, Moncef (Department of Mathematics College of Sciences King Saud University) ;
  • Boudabbous, Youssef (Department of Mathematics College of Sciences King Saud University) ;
  • Amri, Nadia El (Departement de Mathematiques Faculte des Sciences de Monastir Universite de Monastir)
  • Received : 2010.02.10
  • Published : 2011.05.01

Abstract

Let T = (V,A) be a tournament. With every subset X of V is associated the subtournament T[X] = (X, A ${\cap}$ (X${\times}$X)) of T, induced by X. The dual of T, denoted by $T^*$, is the tournament obtained from T by reversing all its arcs. Given a tournament T' = (V,A') and a non-negative integer ${\kappa}$, T and T' are {$-{\kappa}$}-hemimorphic provided that for all X ${\subset}$ V, with ${\mid}X{\mid}$ = ${\kappa}$, T[V-X] and T'[V-X] or $T^*$[V-X] and T'[V-X] are isomorphic. The tournaments T and T' are said to be hereditarily hemimorphic if for all subset X of V, the subtournaments T[X] and T'[X] are hemimorphic. The purpose of this paper is to establish the hereditary hemimorphy of the {$-{\kappa}$}-hemimorphic tournaments on at least k + 7 vertices, for every ${\kappa}{\geq}5$.

Keywords

References

  1. J. A. Bondy, A graph reconstructor's manual, Surveys in combinatorics, 1991 (Guildford, 1991), 221-252, London Math. Soc. Lecture Note Ser., 166, Cambridge Univ. Press, Cambridge, 1991.
  2. J. A. Bondy and R. L. Hemminger, Graph reconstruction-a survey, J. Graph Theory 1 (1977), no. 3, 227-268. https://doi.org/10.1002/jgt.3190010306
  3. M. Bouaziz and Y. Boudabbous, La demi-isomorphie et les tournois fortement connexes finis, C. R. Math. Acad. Sci. Paris 335 (2002), no. 2, 105-110. https://doi.org/10.1016/S1631-073X(02)02439-1
  4. H. Bouchaala and Y. Boudabbous, La {-k}-autodualite des sommes lexicographiques finies de tournois suivant un 3-cycle ou un tournoi critique, Ars Combin. 81 (2006), 33-64.
  5. Y. Boudabbous, Isomorphie hereditaire et {-4}-hypomorphie pour les tournois, C. R. Math. Acad. Sci. Paris 347 (2009), no. 15-16, 841-844. https://doi.org/10.1016/j.crma.2009.06.002
  6. Y. Boudabbous and J. Dammak, Sur la (-k)-demi-reconstructibilite des tournois finis, C. R. Acad. Sci. Paris Ser. I Math. 326 (1998), no. 9, 1037-1040. https://doi.org/10.1016/S0764-4442(98)80010-4
  7. Y. Boudabbous and G. Lopez, La relation difference et l'anti-isomorphie, Math. Logic Quart. 41 (1995), no. 2, 268-280. https://doi.org/10.1002/malq.19950410213
  8. A. Boussairi, P. Ille, G. Lopez, and S. Thomasse, The C3-structure of the tournaments, Discrete Math. 277 (2004), no. 1-3, 29-43. https://doi.org/10.1016/S0012-365X(03)00244-9
  9. A. Ehrenfeucht and G. Rozenberg, Primitivity is hereditary for 2-structures, Theoret. Comput. Sci. 70 (1990), no. 3, 343-358. https://doi.org/10.1016/0304-3975(90)90131-Z
  10. R. Fraisse, Abritement entre relations et specialement entre chaines, Symposia Mathematica, Vol. V (INDAM, Rome, 1969/70) pp. 203-251 Academic Press, London, 1971.
  11. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar 18 (1967), 25-66. https://doi.org/10.1007/BF02020961
  12. C. Gnanvo and P. Ille, La reconstructibilite des tournois, C. R. Acad. Sci. Paris Ser. I Math. 306 (1988), no. 14, 577-580.
  13. J. G. Hagendorf and G. Lopez, La demi-reconstructibilite des relations binaires d'aumoins 13 elements, C. R. Acad. Sci. Paris Ser. I Math. 317 (1993), no. 1, 7-12.
  14. P. Ille, La reconstructibilite des relations binaires, C. R. Acad. Sci. Paris Ser. I Math. 306 (1988), no. 15, 635-638.
  15. G. Lopez, Deux resultats concernant la determination d'une relation par les types d'isomorphie de ses restrictions, C. R. Acad. Sci. Paris Ser. A-B 274 (1972), A1525-A1528.
  16. G. Lopez, Sur la determination d'une relation par les types d'isomorphie de ses restrictions, C. R. Acad. Sci. Paris Ser. A-B 275 (1972), A951-A953.
  17. G. Lopez, L'indeformabilite des relations et multirelations binaires, Z. Math. Logik Grundlag. Math. 24 (1978), no. 4, 303-317. https://doi.org/10.1002/malq.19780241905
  18. G. Lopez and C. Rauzy, Reconstruction of binary relations from their restrictions of cardinality 2, 3, 4 and (n - 1). I, Z. Math. Logik Grundlag. Math. 38 (1992), no. 1, 27-37. https://doi.org/10.1002/malq.19920380104
  19. G. Lopez and C. Rauzy, Reconstruction of binary relations from their restrictions of cardinality 2, 3, 4 and (n - 1). II, Z. Math. Logik Grundlag. Math. 38 (1992), no. 2, 157-168. https://doi.org/10.1002/malq.19920380111
  20. J. W. Moon, Topic on Tournaments, Holt, Rinehart and Winston, New York, 1968.
  21. M. Pouzet, Application d'une propriete combinatoire des parties d'un ensemble aux groupes et aux relations, Math. Z. 150 (1976), no. 2, 117-134. https://doi.org/10.1007/BF01215230
  22. M. Pouzet, Relations non reconstructibles par leurs restrictions, J. Combin. Theory Ser. B 26 (1979), no. 1, 22-34. https://doi.org/10.1016/0095-8956(79)90039-X
  23. K. B. Reid and C. Thomassen, Strongly self-complementary and hereditarily isomorphic tournaments, Monatsh. Math. 81 (1976), no. 4, 291-304. https://doi.org/10.1007/BF01387756

Cited by

  1. Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for $$k \in \{3, 4\}$$ k ∈ { 3 , 4 } vol.32, pp.5, 2016, https://doi.org/10.1007/s00373-016-1706-y
  2. The (6)-half-reconstructibility of digraphs vol.352, pp.7-8, 2014, https://doi.org/10.1016/j.crma.2014.03.009
  3. Les paires de tournois -hypomorphes vol.350, pp.9-10, 2012, https://doi.org/10.1016/j.crma.2012.04.022