The Game Saturation Number of a Graph
نویسندگان
چکیده
منابع مشابه
The Game Saturation Number of a Graph
Given a family F and a host graph H, a graph G ⊆ H is F-saturated relative to H if no subgraph of G lies in F but adding any edge from E(H)−E(G) to G creates such a subgraph. In the F-saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in F , until G becomes F-saturated relative to H. They aim to maximize or minimize the length of the game, respectively...
متن کاملroman game domination subdivision number of a graph
a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...
متن کاملIrredundance saturation number of a graph
Let G = (V,E) be a graph and let v ∈ V. Let IRS(v,G) denote the maximum cardinality of an irredundant set in G which contains v. Then IRS(G) = min {IRS(v,G) : v ∈ V } is called the irredundance saturation number of G. In this paper we initiate a study of this parameter.
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2016
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22074