Allan, Robert B.; Laskar, Renu On domination and independent domination numbers of a graph. (English) Zbl 0416.05064 Discrete Math. 23, 73-76 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 81 Documents MSC: 05C99 Graph theory Keywords:graph; domination number; independent domination number PDFBibTeX XMLCite \textit{R. B. Allan} and \textit{R. Laskar}, Discrete Math. 23, 73--76 (1978; Zbl 0416.05064) Full Text: DOI References: [1] Berge, C., Graphs and Hypergraphs, ((1973), North-Holland: North-Holland Amsterdam), 309 · Zbl 0483.05029 [2] Cockayne, E.; Hedetniemi, S., Towards a theory of domination in graphs, Networks Fall, 247-261 (1977) · Zbl 0384.05051 [3] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064 [4] Hamada, T.; Yoshimura, I., Traversability and connectivity of the middle graph of a graph, Discrete Math., 14, 247-255 (1976) · Zbl 0319.05122 [5] Hedetniemi, S.; Mitchell, S., Independent domination in Trees, Proc. Eighth S.E. Conf. on Combinatorics, Graph Theory, and Computing (1977), Baton Rouge, LA · Zbl 0433.05023 [6] Ore, O., Theory of Graphs, (Amer. Math. Soc. Colloquium Pub., Vol. XXXVIII (1962), Amer. Math. Soc: Amer. Math. Soc Providence, Rhode Island), 206 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.