An upper bound on the paired-domination number in terms of the number of edges in the graph
Copyright policy )An upper bound on the paired-domination number in terms of the number of edges in the graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Johannesburg South Africa
minimum degree 2, perfect matching, paired domination set, size, Theoretical Computer Science, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Discrete Mathematics and Combinatorics, bounds, paired domination number
minimum degree 2, perfect matching, paired domination set, size, Theoretical Computer Science, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Discrete Mathematics and Combinatorics, bounds, paired domination number
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!