اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCritical Pebbling Numbers of Graphs
179
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 yields 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$.
قيم البحث
اقرأ أيضاً
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.
The theta graph $Theta_{ell,t}$ consists of two vertices joined by $t$ vertex-disjoint paths of length $ell$ each. For fixed odd $ell$ and large $t$, we show that the largest graph not containing $Theta_{ell,t}$ has at most $c_{ell} t^{1-1/ell}n^{1+1
/ell}$ edges and that this is tight apart from the value of $c_{ell}$.
The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $Gamma$ is the set of all fixing numbers of finite graphs with a
utomorphism group $Gamma$. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label $G$ so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label may be used only once, and not every vertex need be labeled. We characterize the fixing sets of finite abelian groups, and investigate the fixing sets of symmetric groups.
The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{circ alpha} := (a_{ij}^alpha)$ is positive semidefinite for every entr
ywise nonnegative $n times n$ positive semidefinite matrix $A = (a_{ij})$ if and only if $alpha$ is a positive integer or $alpha geq n-2$. This surprising result naturally extends the Schur product theorem, and demonstrates the existence of a sharp phase transition in preserving positivity. In this paper, we study when entrywise powers preserve positivity for matrices with structure of zeros encoded by graphs. To each graph is associated an invariant called its critical exponent, beyond which every power preserves positivity. In our main result, we determine the critical exponents of all chordal/decomposable graphs, and relate them to the geometry of the underlying graphs. We then examine the critical exponent of important families of non-chordal graphs such as cycles and bipartite graphs. Surprisingly, large families of dense graphs have small critical exponents that do not depend on the number of vertices of the graphs.
An edge-coloring of a connected graph $G$ is called a {em monochromatic connection coloring} (MC-coloring for short) if any two vertices of $G$ are connected by a monochromatic path in $G$. For a connected graph $G$, the {em monochromatic connection
number} (MC-number for short) of $G$, denoted by $mc(G)$, is the maximum number of colors that ensure $G$ has a monochromatic connection coloring by using this number of colors. This concept was introduced by Caro and Yuster in 2011. They proved that $mc(G)leq m-n+k$ if $G$ is not a $k$-connected graph. In this paper we depict all graphs with $mc(G)=m-n+k+1$ and $mc(G)= m-n+k$ if $G$ is a $k$-connected but not $(k+1)$-connected graph. We also prove that $mc(G)leq m-n+4$ if $G$ is a planar graph, and classify all planar graphs by their monochromatic connectivity numbers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
