اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBounds on the Rubbling and Optimal Rubbling Numbers of Graphs
93
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and $w$ adjacent to a vertex $u$, and an extra pebble is added at vertex $u$. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The rubbling number is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. The optimal rubbling number is the smallest number $m$ needed to guarantee a pebble distribution of $m$ pebbles from which any vertex is reachable. We give bounds for rubbling and optimal rubbling numbers. In particular, we find an upper bound for the rubbling number of $n$-vertex, diameter $d$ graphs, and estimates for the maximum rubbling number of diameter 2 graphs. We also give a sharp upper bound for the optimal rubbling number, and sharp upper and lower bounds in terms of the diameter.
قيم البحث
اقرأ أيضاً
Let $G$ be a simple graph with $2n$ vertices and a perfect matching. The forcing number of a perfect matching $M$ of $G$ is the smallest cardinality of a subset of $M$ that is contained in no other perfect matching of $G$. Let $f(G)$ and $F(G)$ denot
e the minimum and maximum forcing number of $G$ among all perfect matchings, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique perfect matching is $n^2$ (see Lov{a}sz [20]). We know that $G$ has a unique perfect matching if and only if $f(G)=0$. Along this line, we generalize the classical result to all graphs $G$ with $f(G)=k$ for $0leq kleq n-1$, and obtain that the number of edges is at most $n^2+2nk-k^2-k$ and characterize the extremal graphs as well. Conversely, we get a non-trivial lower bound of $f(G)$ in terms of the order and size. For bipartite graphs, we gain corresponding stronger results. Further, we obtain a new upper bound of $F(G)$. Finally some open problems and conjectures are proposed.
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
For a simple, undirected and connected graph $G$, $D_{alpha}(G) = alpha Tr(G) + (1-alpha) D(G)$ is called the $alpha$-distance matrix of $G$, where $alphain [0,1]$, $D(G)$ is the distance matrix of $G$, and $Tr(G)$ is the vertex transmission diagonal
matrix of $G$. Recently, the $alpha$-distance energy of $G$ was defined based on the spectra of $D_{alpha}(G)$. In this paper, we define the $alpha$-distance Estrada index of $G$ in terms of the eigenvalues of $D_{alpha}(G)$. And we give some bounds on the spectral radius of $D_{alpha}(G)$, $alpha$-distance energy and $alpha$-distance Estrada index of $G$.
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.
An edge-coloured path is emph{rainbow} if all the edges have distinct colours. For a connected graph $G$, the emph{rainbow connection number} $rc(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connect
ed by a rainbow path. Similarly, the emph{strong rainbow connection number} $src(G)$ is the minimum number of colours in an edge-colouring of $G$ such that, any two vertices are connected by a rainbow geodesic (i.e., a path of shortest length). These two concepts of connectivity in graphs were introduced by Chartrand et al.~in 2008. Subsequently, vertex-colour
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
