Edge cover time for regular graphs

MaRDI QIDQ3536771zbMATH OpenFDO

Authors Roberto Tauraso

Publication date 21 November 2008

Full work available at URL https://eudml.org/doc/54855, http://www.emis.de/journals/JIS/VOL11/Tauraso/tauraso18.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

coupon collector's problemedge covergraph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• The Cover Time of Random Regular Graphs
• On the cover time of random walks on graphs
• Bounds on the cover time
• The cover time of a biased random walk on a random regular graph of odd degree
• The cover time of a biased random walk on a random regular graph of odd degree

Cited in

(7)

• Optimal cover time for a graph-based coupon collector process
• Sampling Edge Covers in 3-Regular Graphs
• Cover time in edge-uniform stochastically-evolving graphs
• Basic retracts and counting of lattices
• The Cover Time of Random Regular Graphs
• Automata, Languages and Programming
• Equivalence of labeled graphs and lattices

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Edge cover time for regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536771)