Sampling complete designs
Copyright policy )Sampling complete designs
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are also provided.
16 Pages [see the text for the full abstract]
Graphs; complete designs; sampling, (Complete) design, embedding of designs, 05B30, 05C51, 05E18, Other designs, configurations, Theoretical Computer Science, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Sampling, complete graph, Embedding
Graphs; complete designs; sampling, (Complete) design, embedding of designs, 05B30, 05C51, 05E18, Other designs, configurations, Theoretical Computer Science, FOS: Mathematics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), Sampling, complete graph, Embedding
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).0 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!