Fricke, Gerd H.; Haynes, Teresa W.; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; Laskar, Renu C. Excellent trees. (English) Zbl 0995.05036 Bull. Inst. Comb. Appl. 34, 27-38 (2002). Let \(\mu(G)\) be a numerical invariant of a graph \(G\) defined in such a way that it is the minimum or maximum number of vertices of a set \(S\subseteq V(G)\) with a given property \(P\). A set with the property \(P\) and with \(\mu(G)\) vertices in \(G\) is called a \(\mu(G)\)-set. If a vertex of \(G\) is contained in some \(\mu(G)\)-set, it is called \(\mu\)-good and otherwise it is called \(\mu\)-bad. If every vertex of \(G\) is \(\mu\)-good, the graph \(G\) is called \(\mu\)-excellent. The property of being a \(\mu\)-excellent tree is studied for three invariants \(\mu(G)\), namely the domination number \(\gamma(G)\), the irredundance number \(\text{ir}(G)\) and the independence number \(\beta(G)\). Reviewer: Bohdan Zelinka (Liberec) Cited in 2 ReviewsCited in 11 Documents MSC: 05C05 Trees 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) Keywords:\(\mu\)-excellent graph; \(\mu\)-excellent tree; domination number; irredundance number; independence number PDFBibTeX XMLCite \textit{G. H. Fricke} et al., Bull. Inst. Comb. Appl. 34, 27--38 (2002; Zbl 0995.05036)