Pebbling Number of Polymers

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Aghaei Fatemeh; Alikhani Saeid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2025 | Volume:16 | Issue:1 Page(s): 39-49

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Pebbling Number of Polymers

Author(s)

Aghaei Fatemeh | Alikhani Saeid | Issue Writer Certificate

Keywords

Cactus graph

2-restricted pebbling configuration

Optimal pebbling number

Pebbling number

Polymer

Abstract

‎Let $G=(V, E)$ be a simple graph‎. A function $f: V\rightarrow \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the quantity $\vert f\vert=\sum_{u\in V}f(u)$‎ ‎is called the weight of $f$ which is just the total number of pebbles assigned to vertices‎. ‎A pebbling step from a vertex $u$ to one of its‎ neighbors $v$ reduces $f(u)$ by two and increases $f(v)$ by one‎. ‎A pebbling configuration $f$ is said to be solvable if for every vertex $ v $‎, ‎there exists a sequence (possibly empty) of pebbling moves that results in a pebble on $v$‎. ‎The Pebbling number $ \pi(G) $ equals the minimum number $ k $ such that every pebbling configuration $ f $ with $ \vert f\vert = k $ is solvable‎. Let $ G $ be a connected graph constructed from pairwise disjoint connected graphs $ G_1, . . ., G_k $ by selecting a vertex of $ G_1 $‎, ‎a vertex of $ G_2 $‎, ‎and identifying these two vertices‎. ‎Then continue in this manner inductively‎. ‎We say that $ G $ is a Polymer graph‎, ‎obtained by point-attaching from monomer units $ G_1, . . ., G_k $‎. In this paper‎, ‎we study the Pebbling number of some Polymers‎. ‎

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans