This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
E. J. Cockayne, B. L. Hartnell and S. T. Hedetniemi, An Algorithm for two Disjoint Matchings in a Tree (submitted).
E. J. Cockayne, S. Goodman and S. T. Hedetniemi, A Linear Algorithm for the Domination Number of a Tree, Information Processings Letters 4 (1975), 41–44.
E. J. Cockayne and S. T. Hedetniemi, Optimal Domination in Graphs, IEEE Trans. on Circuits and Systems, Vol. CAS-22 No. 11 (1975), 855–857.
E. J. Cockayne and S. T. Hedetniemi, Disjoint Independent Dominating Sets in Graphs, Discrete Math (to appear).
E. J. Cockayne and S. T. Hedetniemi, Towards a theory of Domination in Graphs, Networks (to appear).
E. J. Cockayne and S. T. Hedetniemi, On Group Graphs with Disjoint Cliques (submitted).
E. J. Cockayne and S. T. Hedetniemi, Which Treeds do not have Disjoint Matchings, Utilitas Math (to appear).
E. J. Cockayne and S. T. Hedetniemi, Disjoint Cliques in Regular Graphs of degree seven or eight, J. Comb. Theory (to appear).
E. J. Cockayne and F. D. K. Roberts, Computation of Dominating Partitions (submitted).
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
F. Harary, S. T. Hedetniemi and G. Prins, An Interpolation Theorem for Graphical Homomorphisms, Portugal Math 26 (1967), 454–462.
B. L. Hartnell, Disjoint Matchings in Unicyclic Graphs, Utilitas Math (to appear).
F. Jaegar and C. Payan, Relations du type Nordhaus-Gaddum pour le Nombre d'absorption d'un graphe simple, C. R. Acad. Sc. Paris, Series A, t. 274, (1972), 728–730.
R. Karp, Reducibility Among combinatorial problems, Complexity of Computer Computations (R. E. Miller and J. W. Thatcher eds.), Plenum Press, New York (1972), 85–104.
C. L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968.
J. Moon and A. Meir, Relations between packing and covering numbers of a tree, Pacific. J. Math Vol 61 No. 1 (1975), 225–233.
J. Nieminen, Two bounds for the domination number of a graph, J. Inst. Maths. Applics 14 (1974), 183–187.
E. A. Nordhaus and J. W. Gaddum, On Complementary Graphs, American Math. Monthly 63 (1956), 175–177.
O. Ore, Theory of Graphs, American Math. Soc. Colloq. Publ. 38, Providence, R. I., 1962.
P. J. Slater, A constructive characterisation of trees having no k maximum matchings (submitted).
V. G. Vizing, A bound on the External Stability Number of a Graph, Doklady A. N. 164 (1965), 729–731.
V. G. Vizing, The Cartesian product of graphs, Vyč. Sis., 9, 1963, p 30–43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cockayne, E.J. (1978). Domination of undirected graphs — A survey. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070371
Download citation
DOI: https://doi.org/10.1007/BFb0070371
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive
