On Universal Cycles of Labeled Graphs
Copyright policy )On Universal Cycles of Labeled Graphs
A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with $m$ edges, graphs with loops, graphs with multiple edges (with up to $m$ duplications of each edge), directed graphs, hypergraphs, and $k$-uniform hypergraphs.
- Harvard University United States
- Rose–Hulman Institute of Technology United States
- East Tennessee State University United States
- University of South Carolina System United States
- University of South Carolina United States
Graph labelling (graceful graphs, bandwidth, etc.), Eulerian and Hamiltonian graphs, universal cycle, de Bruijn cycles, FOS: Mathematics, Mathematics - Combinatorics, arc digraph, 05C30, Structural characterization of families of graphs, Combinatorics (math.CO), labeled graphs
Graph labelling (graceful graphs, bandwidth, etc.), Eulerian and Hamiltonian graphs, universal cycle, de Bruijn cycles, FOS: Mathematics, Mathematics - Combinatorics, arc digraph, 05C30, Structural characterization of families of graphs, Combinatorics (math.CO), labeled graphs
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).5 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!