相关论文: On the Lucky labeling of Graphs

Given a graph $G$ with $n$ vertices and a bijective labeling of the vertices using the integers $1,2,\ldots, n$, we say $G$ has a peak at vertex $v$ if the degree of $v$ is greater than or equal to 2, and if the label on $v$ is larger than…

Let $\gamma(G)$ and $\beta(G)$ denote the domination number and the covering number of a graph $G$, respectively. A connected non-trivial graph $G$ is said to be $\gamma\beta$-{perfect} if $\gamma(H)=\beta(H)$ for every non-trivial induced…

A graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishing number $D(G)$ is the least integer $k$ for which $G$ is…

We study a version of the lights out game played on directed graphs. For a digraph $D$, we begin with a labeling of $V(D)$ with elements of $\mathbb{Z}_k$ for $k \ge 2$. When a vertex $v$ is toggled, the labels of $v$ and any vertex that…

A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. A set…

The colouring number col(G) of a graph G is the smallest integer k for which there is an ordering of the vertices of G such that when removing the vertices of G in the specified order no vertex of degree more than k-1 in the remaining graph…

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

A graph $(p, q)$ graph $G = (V, E)$ is said to be $(k, d)$-hooked Skolem graceful if there exists a bijection $f:V (G)\rightarrow \{1, 2, \dots, p-1, p+1\}$ such that the induced edge labeling $g_f : E \rightarrow \{k, k+d, \dots, k+(n-1)d…

For integers $k>0$ and $0<r \leq \Delta$ (where $r \leq k$), a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to vertices with at…

Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule results in all vertices being in $S$. The forcing rule is: if a vertex $v$…

A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we…

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

A k-ranking of a graph G is a labeling of the vertices of G with values from {1,...,k} such that any path joining two vertices with the same label contains a vertex having a higher label. The tree-depth of G is the smallest value of k for…

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

A graph is h-perfect if its stable set polytope can be completely described by non-negativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4. For every graph $G$ and every…

Let $G=(V,E)$ be a simple graph and $(2k+1)$ be a prime integer. Let each vertex of $G$ be colored using one of the $(2k+1)$ colors, say $R_1,R_2,...,R_{2k+1}$. If every vertex has an equal number of neighbors of each color, then the…

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $G$ is in $S$ or is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The domination number…

Four algorithms giving rise to graceful graphs from a known (non)graceful graph are described. Some necessary conditions for a graph to be highly graceful and critical are given. Finally some conjectures are made on graceful, critical and…

A prime labeling of a graph with $n$ vertices is a labeling of its vertices with distinct integers from $\{1, 2,\ldots , n\}$ in such a way that the labels of any two adjacent vertices are relatively prime. T. Varkey conjectured that ladder…

One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…