Domination in partitioned graphs
Copyright policy )Domination in partitioned graphs
Let \(V_1\), \(V_2\) be a bipartition of \(V(G)\) and let \(\gamma_i\) stand for the least number of vertices in the graph \(G\) needed to dominate \(V_i\). The authors prove that \(\gamma_1+ \gamma_2\leq{4\over 5}|V(G)|\) and conjecture that \(\gamma_1+\gamma_2\leq {4\over \delta+3} |V(G)|\) for graphs \(G\) of minimum degree \(\delta\leq 5\).
- Aalborg University Denmark
- Aalborg University Library (AUB) Denmark
vertex partition, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), domination number, Structural characterization of families of graphs, dominating set
vertex partition, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), domination number, Structural characterization of families of graphs, dominating set
citations 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).12 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).Top 10% 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!