Results 51 to 60 of about 1,516 (111)
Maximal Independent Sets In Graphs With At Most r Cycles
, 2005 We find the maximum number of maximal independent sets in two families of graphs: all graphs with $n$ vertices and at most $r$ cycles, and all such graphs that are also connected.
Diestel +9 more
core +5 more sources
On the Roman Bondage Number of Graphs on surfaces [PDF]
, 2014 A Roman dominating function on a graph $G$ is a labeling $f : V(G) \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The Roman domination number, $\gamma_R(G)$, of $G$ is the minimum of $\Sigma_{v\in V (G)} f(v)
Samodivkin, Vladimir
core
GLOBAL RAINBOW DOMINATION IN GRAPHS
, 2017 For a positive integer k, a k-rainbow dominating function (kRDF) of a graph G is a function f from the vertex set V.G/ to the set of all subsets of the set f1;2; : : : ;kg such that for any vertex v 2 V.G/ with f .v/ D ¿, the condition S u2N.v/f .u/ D f1;
J. Amjadi +2 more
semanticscholar +1 more source
A Constructive Characterization of Vertex Cover Roman Trees
Discussiones Mathematicae Graph Theory, 2021 A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera +2 more
doaj +1 more source
Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers
Discussiones Mathematicae Graph Theory, 2021 Given a graph G =(V, E) and two its distinct vertices u and v, the (u, v)-Pk-addition graph of G is the graph Gu,v,k−2 obtained from disjoint union of G and a path Pk : x0, x1,...,xk−1, k ≥ 2, by identifying the vertices u and x0, and identifying the ...
Samodivkin Vladimir
doaj +1 more source
Total Dominator Chromatic Number on Various Classes of Graphs
International journal of scientific research and reviews, 2019 Let G be a graph with minimum degree at least one. A total dominator coloring of G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class.
Dr.A. Vijayalekshmi, S. Anusha
semanticscholar +1 more source
Connected domination game played on Cartesian products
Open Mathematics, 2019 The connected domination game on a graph G is played by Dominator and Staller according to the rules of the standard domination game with the additional requirement that at each stage of the game the selected vertices induce a connected subgraph of G. If
Bujtás Csilla +3 more
doaj +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
A NOTE ON THE HOP DOMINATION NUMBER OF A SUBDIVISION GRAPH
International Journal of Apllied Mathematics, 2019 Let G = (V,E) be a graph with p vertices and q edges. A subset S ⊂ V (G) is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number
C. Natarajan, S. Ayyaswamy
semanticscholar +1 more source
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core +1 more source