×

Found 83 Documents (Results 1–83)

The spanning tree enumerating problem for digraphs. (English) Zbl 0844.05053

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 277-287 (1995).
MSC:  05C30 05C05 05C20
PDFBibTeX XMLCite

Enumeration of Hamilton paths in Cayley digraphs on semidirect products of cyclic groups. (English) Zbl 0843.05051

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 251-263 (1995).
PDFBibTeX XMLCite

Detour distance in digraphs. (English) Zbl 0843.05032

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1155-1167 (1995).
MSC:  05C12 05C20
PDFBibTeX XMLCite

Interval digraphs that are indifference digraphs. (English) Zbl 0843.05046

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 751-765 (1995).
MSC:  05C20 05C50
PDFBibTeX XMLCite

Annihilating uniqueness of Möbius ladder digraphs. (English) Zbl 0843.05047

Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 743-750 (1995).
MSC:  05C20
PDFBibTeX XMLCite

Cayley digraphs of finite cyclic groups with minimal average distance. (English) Zbl 0838.05061

Hsu, Frank (ed.) et al., Interconnection networks and mapping scheduling parallel computations. Proceedings of a DIMACS workshop held Feb. 7-9, 1994 at Rutgers University, New Brunswick, NJ, USA. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 21, 229-250 (1995).
MSC:  05C25 05C35 11B13
PDFBibTeX XMLCite

Modification of consecutive-\(d\) digraphs. (English) Zbl 0837.05079

Hsu, Frank (ed.) et al., Interconnection networks and mapping scheduling parallel computations. Proceedings of a DIMACS workshop held Feb. 7-9, 1994 at Rutgers University, New Brunswick, NJ, USA. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 21, 75-85 (1995).
MSC:  05C40 05C20
PDFBibTeX XMLCite

Restricted routing and wide diameter of the cycle prefix network. (English) Zbl 0838.68006

Hsu, Frank (ed.) et al., Interconnection networks and mapping scheduling parallel computations. Proceedings of a DIMACS workshop held Feb. 7-9, 1994 at Rutgers University, New Brunswick, NJ, USA. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 21, 31-46 (1995).
PDFBibTeX XMLCite
Full Text: arXiv

Filter Results by …

Document Type

all top 5

Author

all top 3

Main Field

Software