اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn properly ordered coloring of vertices in a vertex-weighted graph
206
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 equal 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$.
قيم البحث
اقرأ أيضاً
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds either a cliqu
e and coloring of the same size or a Meyniel obstruction. We also give a O(n^3) algorithm that, for any graph, finds either aneasily recognizable strong stable set or a Meyniel obstruction.
We study a combinatorial coloring game between two players, Spoiler and Algorithm, who alternate turns. First, Spoiler places a new token at a vertex in $G$, and Algorithm responds by assigning a color to the new token. Algorithm must ensure that tok
ens on the same or adjacent vertices receive distinct colors. Spoiler must ensure that the token graph (in which two tokens are adjacent if and only if their distance in $G$ is at most $1$) has chromatic number at most $w$. Algorithm wants to minimize the number of colors used, and Spoiler wants to force as many colors as possible. Let $f(w,G)$ be the minimum number of colors needed in an optimal Algorithm strategy. A graph $G$ is online-perfect if $f(w,G) = w$. We give a forbidden induced subgraph characterization of the class of online-perfect graphs. When $G$ is not online-perfect, determining $f(w,G)$ seems challenging; we establish $f(w,G)$ asymptotically for some (but not all) of the minimal graphs that are not online-perfect. The game is motivated by a natural online coloring problem on the real line which remains open.
Let $G = (V, E)$ be a finite simple undirected graph without $K_2$ components. A bijection $f : E rightarrow {1, 2,cdots, |E|}$ is called a {bf local antimagic labeling} if for any two adjacent vertices $u$ and $v$, they have different vertex sums, i
.e. $w(u) eq w(v)$, where the vertex sum $w(u) = sum_{e in E(u)} f(e)$, and $E(u)$ is the set of edges incident to $u$. Thus any local antimagic labeling induces a proper vertex coloring of $G$ where the vertex $v$ is assigned the color(vertex sum) $w(v)$. The {bf local antimagic chromatic number} $chi_{la}(G)$ is the minimum number of colors taken over all colorings induced by local antimagic labelings of $G$. In this article among others we determine completely the local antimagic chromatic number $chi_{la}(Gcirc overline{K_m})$ for the corona product of a graph $G$ with the null graph $overline{K_m}$ on $mgeq 1$ vertices, when $G$ is a path $P_n$, a cycle $C_n$, and a complete graph $K_n$.
It is conjectured that every edge-colored complete graph $G$ on $n$ vertices satisfying $Delta^{mon}(G)leq n-3k+1$ contains $k$ vertex-disjoint properly edge-colored cycles. We confirm this conjecture for $k=2$, prove several additional weaker result
s for general $k$, and we establish structural properties of possible minimum counterexamples to the conjecture. We also reveal a close relationship between properly edge-colored cycles in edge-colored complete graphs and directed cycles in multi-partite tournaments. Using this relationship and our results on edge-colored complete graphs, we obtain several partial solutions to a conjecture on disjoint cycles in directed graphs due to Bermond and Thomassen.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
