Abstract
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating set for undirected graphs. Whereas dominating sets for digraphs have more applications than undirected graphs. We construct dominating sets of generalized de Bruijn digraphs under some conditions. We investigate consecutive minimum dominating set of the generalized de Bruijn digraphs. For generalized Kautz digraphs, there is a consecutive minimum dominating set that is a minimum dominating set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allan, R.B., Laskar, R.: On domination and independent domination number of a graph. Discrete. Math. 23 (1978) 73–76
Barkauskas, A.E., Host, L.H.: Finding efficient dominating sets in oriented graphs. Congr. Numer. 98 (1993) 27–32
Bar-Yehuda, R., Vishkin, U.: Complexity of finding k-path-free dominating sets in graphs. Info. Process. Letter 14 (1982) 228–232
Berge, C., Rao, A.R.: A combinatorial problem in logic. Discrete. Math. 17 (1977) 23–26
Bermond, J.-C. Peyrat, C.: De Bruijn and Kautz networks: a competitor for the hypercube ?. Hypercube and Distributed Computers (F. André and J.P. Verjus, Eds.). Elsevier North-Holland, Amsterdam, 1989
Chaty, G., Szwarcfiter, J.L.: Enumerating the kernels of a directed graph with no odd circuits. Info. Proc. Letter 51 (1994) 149–153
Duchet, P., Meyniel, H.: Kernels in directed graphs: a poison game. Discrete. Math. 115 (1993) 273–276
Fisher, D., Lundgren, J.R., Merz, S.K., Reid, K.B.: Domination graphs of tournaments and digraphs. Congr. Numer. 108 (1995) 97–107
Fraenkel, A.S., Yesha, Y.: Complexity of problems in games,graphs, and algebraic equations. Discrete. Appl. Math. 1 (1979) 15–30
Ghoshal, J., Laskar, R., Pillone, D.: Topics on domination in directed graphs. Domination in graphs (T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Eds.). Marcel Dekker, New York, 1998, 401–437
Haynes, T.W. Hedetniemi, S.T. Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998
Imase, M., Itoh, M.: Design to minimize diameter on building-block network. IEEE Trans. Computer C-30 (1981) 439–442
Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. Computer C-32 (1983) 782–784
Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theor. Comp. Sci. 61 (1988) 307–316
Reddy, S.M., Pradhan, D.K., Kuhl, J.: Directed graphs with minimal diameter and maximum node connectivity. School of Engineering Oakland Univ. Tech. Report, 1980
von Neumann J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton, 1944.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kikuchi, Y., Shibata, Y. (2001). On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_45
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive