Set domination in graphs
Copyright policy ) Sampathkumar, E.; Latha, L. P.;
Set domination in graphs
AbstractLet G = (V, E) be a connected graph. A set D ⊂ V is a set‐dominating set (sd‐set) if for every set T ⊂ V − D, there exists a nonempty set S ⊂ D such that the subgraph 〈S ∪ T〉 induced by S ∪ T is connected. The set‐domination number γs(G) of G is the minimum cardinality of a sd‐set. In this paper we develop properties of this new parameter and relate it to some other known domination parameters.
Graph theory, Extremal problems in graph theory, Connectivity, set domination, connected graph, Mathematics, 004, 510
Graph theory, Extremal problems in graph theory, Connectivity, set domination, connected graph, Mathematics, 004, 510
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).10 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.Top 10% 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
Citations provided by BIP!
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).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 10
Top 10%
Top 10%
Average
Green
Fields of Science (3) View all