Monophonic pebbling number and t-pebbling number of some graphs

DOI10.1080/09728600.2022.2072789zbMATH Open1493.05087OpenAlexW4280513346MaRDI QIDQ5097777FDOQ5097777

Authors: A. Lourdusamy, I. Dhivviyanandam, S. Kither Iammal 

Publication date: 1 September 2022

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09728600.2022.2072789

Recommendations

• The t-pebbling number of Jahangir graph J3,m
• The \(t\)-pebbling number of Jahangir graph
• scientific article; zbMATH DE number 7280167
• The \(t\)-pebbling number of squares of cycles
• \(t\)-pebbling number in graphs

zbMATH Keywords

monophonic distancemonophonic \(t\)-pebbling numbermonophonic pebbling number

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory with applications
• Pebbling in Hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monophonic distance in graphs
• Domination in Jahangir graph J_{2,m}
• Herscovici's conjecture on products of shadow graphs of paths

Cited In (3)

• Monophonic pebbling number of some network-related graphs
• Monophonic pebbling number of some families of cycles
• On the secure vertex cover pebbling number

This page was built for publication: Monophonic pebbling number and \(t\)-pebbling number of some graphs

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