Proof of a conjecture on \(k\)-tuple domination in graphs
From MaRDI portal
Publication:958895
DOI10.1016/j.aml.2007.03.015zbMath1187.05054WikidataQ123132585 ScholiaQ123132585MaRDI QIDQ958895
Erfang Shan, Guangjun Xu, Hong Yan, Li-ying Kang
Publication date: 10 December 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.03.015
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph, On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs, \(k\)-domination and \(k\)-independence in graphs: A survey, Onk-tuple domination of random graphs, A polyhedral view to a generalization of multiple domination, On upper bounds for multiple domination numbers of graphs, 3-factor-criticality in double domination edge critical graphs, Multiple Domination, MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
Cites Work