Zobrazeno 1 - 10
of 437
pro vyhledávání: '"Graph Pebbling"'
Autor:
Alikhani, Saeid, Aghaei, Fatemeh
Let $G=(V,E)$ be a simple graph. A function $\phi:V\rightarrow \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the quantity $\sum_{u\in V}\phi(u)$ is called the size of $\phi$ which is just the total number of pe
Externí odkaz:
http://arxiv.org/abs/2402.10017
Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a gra
Externí odkaz:
http://arxiv.org/abs/2312.12618
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Given a configuration of pebbles on the vertices of a graph $G$, a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of a graph $G$ is the smallest number of pebbles required such that, giv
Externí odkaz:
http://arxiv.org/abs/2310.00580
Autor:
Bergwerf, Herman
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a comprehensive sta
Externí odkaz:
http://arxiv.org/abs/2303.04590
Publikováno v:
In Discrete Applied Mathematics 15 April 2024 347:155-174
Autor:
Fatemeh Aghaei Meybodi, Saeed Alikhani
Publikováno v:
ریاضی و جامعه, Vol 7, Iss 4, Pp 11-32 (2023)
There are many topics in graph theory that can be called ``moving objects around a graph". For example; In network optimization, shipments are transferred from some vertices (resources) to other vertices (demand) according to the costs allocated to t
Externí odkaz:
https://doaj.org/article/f6ff63c2e82e4298956f2a4c6b1fb7bb
Autor:
Binwal, Jitendra1 dr.jitendrabinwaldkm@gmail.com, Devi, Renu2 renu.forensics@gmail.com, Singh, Bhupendra3 bhupendrapoonia003@gmail.com
Publikováno v:
Advances & Applications in Discrete Mathematics. Aug2023, Vol. 39 Issue 2, p259-284. 26p.
Given a distribution of pebbles to the vertices of a graph, a pebbling move removes two pebbles from a single vertex and places a single pebble on an adjacent vertex. The pebbling number $\pi(G)$ is the smallest number such that, for any distribution
Externí odkaz:
http://arxiv.org/abs/1905.08683
Publikováno v:
In Theoretical Computer Science 10 January 2020 803:160-177