QR Kodea

Bounds for the pebbling number of product graphs

Let $G$ be a connected graph. Given a configuration of a fixed number of pebbles on the vertex set of $G$, a pebbling move on $G$ is the process of removing two pebbles from a vertex and adding one pebble on an adjacent vertex. The pebbling number of $G$, denoted by $\pi(G)$, is defined to be the le...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Nopparat Pleanmani, Nuttawoot Nupo, Somnuek Worawiset
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: University of Isfahan 2022-12-01
Saila:Transactions on Combinatorics
Gaiak:
Sarrera elektronikoa:https://toc.ui.ac.ir/article_25997_501663d1ee8baceb41a23ea159ff00d0.pdf
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!