I want search about:
Search by file type
Looking for:
a new upper bound on the domination number of a graph
New
Upper
Bounds
on
the
Distance Dominati
on
In March 2013, by Fat
a
, Smith and Sundaram established
upper
bounds for
the
k-distance dominati
on
numbers
of
grid graphs by generalizing Chang's constructi
on
of
dominating sets to k-distance dominating sets.
File link:
http://web.unlv.edu/misc/mcccc/28/abstracts/Grez.pdf
96%
The
independent dominati
on
number
of
| 2
Upper
bounds
In this secti
on
, we present an
upper
bound
on
the
independent dominati
on
number
of
an MTF
graph
in terms
of
its minimum degree and then its order. Advanced Topics, Marcel Dekker,
New
York, 1998. [10] P.C.B. Lam, W.C. Shiu and L. Sun,
On
independent dominati
on
number
of
.
File link:
http://ajc.maths.uq.edu.au/pdf/42/ajc_v42_p129.pdf
92%
Independent Dominati
on
in Graphs:
A
Survey | 2.1 General Bounds
Extremal graphs for
a
new
upper
bound
on
dominati
on
parameters in graphs. Discrete Math., 306:2314-2326, 2006.
A
bound
on
the
independent dominati
on
number
of
a
tree. Vishw
a
Internat. J.
Graph
Theory, 1:19-27, 1992.
File link:
https://people.cs.clemson.edu/~goddard/papers/idomSurvey.pdf
91%
Characterizati
on
of
Two Dominati
on
Number
and
In this paper, we obtain sharp
upper
bound
for
the
sum
of
the
two dominati
on
number
and chromatic
number
and characterize
the
corresponding extremal graphs. In all
the
above cases, it can be verified that no
new
graph
exists.
File link:
http://www.ripublication.com/irph/ijcsm/IJCSMv3n2_10.pdf
79%
Upper
Bounds for α -Dominati
on
Parameters
We provide
a
new
upper
bound
for
the
α-dominati
on
number
in terms
of
a
parameter α, 0 < α ≤ 1, and
graph
vertex degrees. This result generalises
the
well-known Caro-Roditty
bound
for
the
dominati
on
number
of
a
graph
.
File link:
http://www.cems.uwe.ac.uk...Domination Parameters.pdf
75%
An
upper
bound
on
the
total
We prove
the
following
upper
bound
on
the
total outer-independent dominati
on
number
of
a
tree. [4] T. Haynes, S. Hedetniemi, P. Slater (eds.), Dominati
on
in Graphs: Advanced Topics, Marcel Dekker,
New
York, 1998.
File link:
http://www.opuscula.agh.edu.pl/vol32/1/art/opuscula_math_3212.pdf
74%
Bounds
on
the
k -Dominati
on
Number
of
a
Graph
We prove two bounds
on
the
k-dominati
on
number
of
a
graph
, inspired by two conjectures
of
the
computer program Grati.pc. In particular, we show that for any
graph
with minimum degree at least 2k − 1,
the
k-dominati
on
number
is at most
the
matching
number
.
File link:
https://people.cs.clemson.edu/~goddard/papers/kDomination.pdf
74%
Dominati
on
number
and chromatic | Fuzzy
Graph
G
Fuzzy double dominati
on
number
and chromatic
number
of
a
fuzzy
graph
. an
upper
bound
for
the
sum
of
the
Fuzzy Double Dominati
on
Number
and Chromatic
Number
in fuzzy graphs and characterize. For all
the
remaining cases, no
new
graph
exits.
File link:
http://www.csjournals.com/IJITKM/PDF 4-2/Article_32.pdf
73%
Minimal dominating sets
The
independent dominati
on
number
Other dominati
on
parameters.
Graph
-Theory 9. 10. 11.3. Bounds
on
the
Dominati
on
Number
. Using
the
above theorem we have an
upper
bound
for (G) in terms
of
the
order
of
G.
File link:
http://www.iwr.uni-heidel...theory/graph-theory-9.pdf
72%
The
4/5
Upper
Bound
on
the
Applying Theorem 18 to
the
resulting colored-
graph
G, we have that γtg(G) ≤ 4n/5. To prove
the
upper
bound
on
the
Staller-start game total dominati
on
number
, we [9] T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals
of
Dominati
on
in Graphs, Marcel Dekker, Inc.,
New
York, 1998.
File link:
https://www.fmf.uni-lj.si...Dom_Upper_Bound_final.pdf
72%
1
2
Next Page >>