×

Total domination in graphs. (English) Zbl 0447.05039


MSC:

05C99 Graph theory
PDFBibTeX XMLCite
Full Text: DOI

Online Encyclopedia of Integer Sequences:

Two even followed by one odd; or floor(2n/3).

References:

[1] and , ”On Domination and Independent Domination Numbers of a Graph,” to appear. · Zbl 0416.05064
[2] Benzaken, Ann. Discrete Math. 3 pp 1– (1978)
[3] Graphs and Hypergraphs, North Holland, Amsterdam, 1973.
[4] Domination in Undirected Graphs–A Survey, Theory and Applications of Graphs in America’s Bicentennial Year, and , Eds., Springer-Verlag, New York, to appear.
[5] Cockayne, Discrete Math. 15 pp 213– (1976)
[6] Cockayne, Networks 7 pp 247– (1977)
[7] Cockayne, Information 15 pp 94– (1977)
[8] Jaeger, C. R. Acad. Sci. Paris Ser. A t274 pp 728– (1972)
[9] Theory of Graphs, Am. Math. Soc. Colloq. Publ. 38, Providence, RI, 1962.
[10] Slater, J. Assoc. Comput. Mach. 23 pp 446– (1976) · Zbl 0349.05120 · doi:10.1145/321958.321964
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.