受限 SDC 边覆盖石子移动数
Restricted SDC Edge Cover Pebbling Number
AI总结：
本文定义了图 $G$ 的受限 SDC 边覆盖石子移动数 $ψ_{EC}(G)$，即在特定标号限制下将石子覆盖到目标边的最小石子数，并计算了部分图的该数值。
摘要：
受限边石子分布是在图 $G$ 的边上放置石子，限制条件是标记为 $0$ 的边上只能放置偶数个石子。给定 $G$ 的 SDC 标号，图 $G$ 的受限 SDC 边覆盖石子移动数 $ψ_{EC}(G)$ 是最小的正整数 $m$，使得任意 $m$ 个石子的受限边石子分布，若最终标记为 $0$ 的边上没有石子，则可通过一系列受限边石子移动，将石子同时移动到所有标记为 $1$ 的边上。我们计算了一些图的受限 SDC 边覆盖石子移动数。
英文摘要：
The restricted edge pebbling distribution is a distribution of pebbles on the edges of $G$ is the placement of pebbles on the edges with the restriction that only an even number of pebbles should be placed on the edges with labels $0$. Given an SDC labeling of $G$, the restricted SDC edge cover pebbling number of a graph $G$, $ψ_{EC}(G)$, is the least positive integer $m$ for which any restricted edge pebbling distribution of $m$ pebbles such that at the end there are no pebbles on the edges having label $0$ will allow the shifting of a pebble simultaneously to all edges with label $1$ using a sequence of restricted edge pebbling moves. We compute the restricted SDC edge cover pebbling number for some graphs
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
