I want search about:
Search by file type
Looking for:
a new upper bound on the domination number of a graph
Upper
bound
on
the
number
of
minimal separators
graph
on
n vertices can have at most. - We give
a
new
pro
of
that this
number
is in O.
Upper
bounds
on
sep(n) are used to up-per
bound
the
running time
of
algorithms for enumerating all minimal sep
a
-rators [1,16,20].
File link:
https://arxiv.org/pdf/1503.01203.pdf
99%
Upper
bound
on
the
number
of
minimal separators
graph
on
n vertices can have at most. - We give
a
new
pro
of
that this
number
is in O.
Upper
bounds
on
sep(n) are used to up-per
bound
the
running time
of
algorithms for enumerating all minimal sep
a
-rators [1,16,20].
File link:
https://arxiv.org/pdf/1503.01203.pdf
99%
New
Upper
Bounds
on
the
Distance Dominati
on
Numbers
of
Grids
In March 2013 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://www.math.fau.edu/combinatorics/GrezArmando.pdf
98%
New
Upper
Bounds
on
the
Distance Dominati
on
Numbers
of
Grids
In March 2013 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://www.math.fau.edu/combinatorics/GrezArmando.pdf
98%
An
upper
bound
on
the
dominati
on
number
of
n ... - Semantic Scholar
Feb 21, 2008 ... www.elsevier.com/locate/disc. An
upper
bound
on
the
dominati
on
number
of
n- vertex connected cubic graphs.
A
.V. Kostochk
a
a
,b,∗, B.Y. Stodolsky
a
a
Department
of
Mathematics, .... 1 After this paper was preliminarily accepted, we learned about two
new
interesting results. Lowenstein and Rautenbach ...
File link:
https://pdfs.semanticscho...05ba78d17814f21472642.pdf
98%
Total versi
on
The
game total dominati
on
number
can be bounded by
the
dominati
on
number
as follows. This proves
the
upper
bound
. In order to show its sharpness, let Bk, k ≥ 2, be
the
graph
constructed as follows.
File link:
http://math.furman.edu/~drall/papers/gametotaldomination.pdf
98%
Total versi
on
The
game total dominati
on
number
can be bounded by
the
dominati
on
number
as follows. This proves
the
upper
bound
. In order to show its sharpness, let Bk, k ≥ 2, be
the
graph
constructed as follows.
File link:
http://math.furman.edu/~drall/papers/gametotaldomination.pdf
98%
Bounds
on
roman dominati
on
numbers
of
graphs
In
the
following theorem, an
upper
bound
is presented for Roman dominati
on
numbers. Theorem 3. For any connected
graph
G
on
n vertices [8] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals
of
Dominati
on
in graphs, Marcel Dekker, Inc.,
New
York, 1998.
File link:
http://www.emis.de/journals/MV/084/mv08402.pdf
97%
Upper
bounds for
the
α -dominati
on
number
Upper
bounds for
the
α-dominati
on
number
. Speaker: Andrei Gagarin Jodrey School
of
Computer Science. By using
a
probabilistic method approach, we provide
new
upper
bounds for
the
α-dominati
on
number
γα(G) in terms
of
parameter α and
the
graph
vertex degrees.
File link:
https://www.cs.rhul.ac.uk/home/agagarin/4ECCC_abstract.pdf
97%
Upper
bounds for
the
α -dominati
on
number
Upper
bounds for
the
α-dominati
on
number
. Speaker: Andrei Gagarin Jodrey School
of
Computer Science. By using
a
probabilistic method approach, we provide
new
upper
bounds for
the
α-dominati
on
number
γα(G) in terms
of
parameter α and
the
graph
vertex degrees.
File link:
https://www.cs.rhul.ac.uk/home/agagarin/4ECCC_abstract.pdf
97%
1
2
Next Page >>