相关论文: Two-lit trees for lit-only sigma-game

The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree…

A signed graph $ (G, \Sigma)$ is a graph positive and negative ($\Sigma $ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $ (G, \Sigma)$ is to switch the signs of the edges incident to $v$. If one can obtain $…

Let $G$ be a graph whose edges are each assigned one of the $m$-colours $1, 2, \ldots, m$, and let $\Gamma$ be a subgroup of $S_m$. The operation of switching at a vertex $x$ with respect $\pi \in \Gamma$ permutes the colours of the edges…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

Consider the following game. We are given a tree $T$ and two players (say) Alice and Bob who alternately colour an edge of a tree (using one of $k$ colours). If all edges of the tree get coloured, then Alice wins else Bob wins. Game…

We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.

The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring,…

A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the general position achievement game. The game is played on a…

Whitney's Theorem states that every graph, different from $K_3$ or $K_{1,3}$, is uniquely determined by its line graph. A $1$-line graph of a multi-graph is the graph with as vertices the edges of the multi-graph, and two edges adjacent if…

\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…

A $\Gamma$-labeled graph is an oriented graph with edges invertibly labeled by a group $\Gamma$. We prove a structure theorem for $\Gamma$-labeled graphs which forbid a fixed $\Gamma$-labeled graph as an immersion, for any finite $\Gamma$.…

Consider a game played on a simple graph $G = (V, E)$ where each vertex consists of a clickable light. Clicking any vertex $v$ toggles the on/off state of $v$ and its neighbors. Starting from an initial configuration of lights, one wins the…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

Let $\gamma_g(G)$ be the game domination number of a graph $G$. It is proved that if ${\rm diam}(G) = 2$, then $\gamma_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(G)}{11}\right\rfloor$. The bound is attained: if…

We introduce two variations of the cops and robber game on graphs. These games yield two invariants in $\mathbb{Z}_+\cup\{\infty\}$ for any connected graph $\Gamma$, the {weak cop number $\mathsf{wcop}(\Gamma)$} and the {strong cop number…

{\sc Yama Nim} is a variant of two piles {\sc Nim}. In this ruleset, the player chosses one of the piles and removes at least two tokens from the pile. In the same move, the player adds one token to the other pile. We show the winning…

For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…

We study the generalization of the game Lights Out in which the standard square grid board is replaced by a graph. We examine the probability that, when a graph is chosen uniformly at random from the set of graphs with $n$ vertices and $e$…