Herscovici’s conjecture on C2n × G

DOI10.1142/S1793830920500718zbMath1457.05058OpenAlexW3033156468WikidataQ122984073 ScholiaQ122984073MaRDI QIDQ5858181

S. T. Mathivanan, A. Lourdusamy

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500718

zbMATH Keywords

pebbling numbercycle graphHerscovici's conjecture\(2t\)-pebbling property\(t\)-pebbling conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of Graham's pebbling conjecture
• Pebbling graphs
• The 2-pebbling property and a conjecture of Graham's
• The pebbling number of \(C_5\times C_5\)
• On the \(t\)-pebbling number and the \(2t\)-pebbling property of graphs
• The \(t\)-pebbling number of graphs
• Pebbling in Hypercubes
• The t-pebbling number of Jahangir graph J3,m
• Graham's pebbling conjecture on products of cycles

This page was built for publication: Herscovici’s conjecture on C2n × G