اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA graph pebbling algorithm on weighted graphs
120
0
0.0
(
0
)
تأليف
Nandor Sieben
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.
قيم البحث
اقرأ أيضاً
We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yi
elds 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the $r$-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the $r$-critical pebbling number is $2^d$.
An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved t
hat the star is a tree having the maximal $textrm{sz}(G)$. Finding a tree with the minimal $textrm{sz}(G)$ is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal $textrm{sz}(G)$ is also the connected graph of the given order that attains the minimal weighted Szeged index. Additionally, it is proven that among the bipartite connected graphs the complete balanced bipartite graph $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ attains the maximal $textrm{sz}(G)$,. We believe that the $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ is a connected graph of given order that attains the maximum $textrm{sz}(G)$.
We introduce the notion of a properly ordered coloring (POC) of a weighted graph, that generalizes the notion of vertex coloring of a graph. Under a POC, if $xy$ is an edge, then the larger weighted vertex receives a larger color; in the case of equa
l weights of $x$ and $y$, their colors must be different. In this paper, we shall initiate the study of this special coloring in graphs. For a graph $G$, we introduce the function $f(G)$ which gives the maximum number of colors required by a POC over all weightings of $G$. We show that $f(G)=ell(G)$, where $ell(G)$ is the number of vertices of a longest path in $G$. Another function we introduce is $chi_{POC}(G;t)$ giving the minimum number of colors required over all weightings of $G$ using $t$ distinct weights. We show that the ratio of $chi_{POC}(G;t)-1$ to $chi(G)-1$ can be bounded by $t$ for any graph $G$; in fact, the result is shown by determining $chi_{POC}(G;t)$ when $G$ is a complete multipartite graph. We also determine the minimum number of colors to give a POC on a vertex-weighted graph in terms of the number of vertices of a longest directed path in an orientation of the underlying graph. This extends the so called Gallai-Hasse-Roy-Vitaver theorem, a classical result concerning the relationship between the chromatic number of a graph $G$ and the number of vertices of a longest directed path in an orientation of $G$.
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant operators, which
include the edge Laplacian and the adjacency matrix on graphs. In the case where such an operator has a nontrivial kernel, we construct conformal invariants, providing discrete counterparts of several results in [11,12] established for Riemannian manifolds. In particular, we show that the nodal sets and nodal domains of null eigenvectors are conformal invariants.
Let $G$ be a graph, and let $w$ be a positive real-valued weight function on $V(G)$. For every subset $S$ of $V(G)$, let $w(S)=sum_{v in S} w(v).$ A non-empty subset $S subset V(G)$ is a weighted safe set of $(G,w)$ if, for every component $C$ of the
subgraph induced by $S$ and every component $D$ of $G-S$, we have $w(C) geq w(D)$ whenever there is an edge between $C$ and $D$. If the subgraph of $G$ induced by a weighted safe set $S$ is connected, then the set $S$ is called a connected weighted safe set of $(G,w)$. The weighted safe number $mathrm{s}(G,w)$ and connected weighted safe number $mathrm{cs}(G,w)$ of $(G,w)$ are the minimum weights $w(S)$ among all weighted safe sets and all connected weighted safe sets of $(G,w)$, respectively. Note that for every pair $(G,w)$, $mathrm{s}(G,w) le mathrm{cs}(G,w)$ by their definitions. Recently, it was asked which pair $(G,w)$ satisfies the equality and shown that every weighted cycle satisfies the equality. In this paper, we give a complete list of connected bipartite graphs $G$ such that $mathrm{s}(G,w)=mathrm{cs}(G,w)$ for every weight function $w$ on $V(G)$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
