Skip to main content
SpringerLink
Log in

Unicontour Isomorphic Factorizations of de Bruijn and Kautz Digraphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

In the topology of information networks, problems arise of existence and implementation of a decomposition of some network into factor-graphs that have no common edges and to which certain specified features are assigned. Special attention is given to isomorphic expansions and factorizations of graphs in the case where obtained components are simplest topologic network structures. The factorized character of Bruijn and Kautz graphs on a set of specific families of unicontour oriented factors is proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. J.-C. Bermond and D. Sotteau, “Graph decompositions and G-designs,” in: Proc. 5th British Combinator. Conf., Utilitas Mathematica, Winnipeg (1976), pp. 53–72.

  2. F. Harary and R. W. Robinson, “Isomorphic factorizations, X: Unsolved problems,” J. Graph Theory, 9, 67–86 (1985).

    Google Scholar 

  3. J. F. Fink, “On the decomposition of n-cubes into isomorphic trees,” J. Graph Theory, 14, 405–411 (1990).

    Google Scholar 

  4. Z. Lonc, “Decompositions of graphs into trees,” J. Graph Theory, 13, 393–403 (1989).

    Google Scholar 

  5. M. L. Yu, “On tree factorizations of Kn,” J. Graph Theory, 17, 713–725 (1993).

    Google Scholar 

  6. J.-C. Bermond and P. Hell, “On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs,” J. Graph Theory, 17, 647–655 (1993).

    Google Scholar 

  7. N. P. Khomenko and V. V. Strok, “T-factorization of GB graphs,” in: Graph Theory, Institute of Mathematics, National Academy of Sciences of Ukraine, Kiev (1977), pp. 135–142.

    Google Scholar 

  8. M. I. Kratko and V. V. Strok, “De Bruijn sequences with constraints,” in: Questions of Cybernetics: Combinatorial Analysis and Graph Theory, Scient. Council on the Complex Problem “Cybernetics,” Akad. Nauk SSSR, Moscow (1980), pp. 80–84.

    Google Scholar 

  9. H. Sachs, “Uber Teiler, Faktoren und charakteristische Polynome von Graphen. Teil I,” Wiss. Z. TH Ilmenau., 12, 7–12 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, National Academy of Sciences of Ukraine, Kiev, Ukraine

    V. V. Strok

Authors
  1. V. V. Strok
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Strok, V.V. Unicontour Isomorphic Factorizations of de Bruijn and Kautz Digraphs. Cybernetics and Systems Analysis 40, 478–485 (2004). https://doi.org/10.1023/B:CASA.0000047869.16553.68

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000047869.16553.68

Search

Navigation