I want search about:
Search by file type
Looking for:
1 2 domination in middle and central graph of pn cn
On
2
-dominating kernels
in
graphs
In
this paper we give a characterization
of
special classes
of
graphs
and
their products with a
2
-dominating kernel. We rst consider paths
and
cycles
and
we establish necessary
and
sucient conditions for the existence
of
2
-dominating kernels
in
these graphs.
File link:
http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p273.pdf
92%
Domination
integrity
of
total graphs
Here we determine the
domination
integrity
of
total graphs
of
path
Pn
, cycle
Cn
and
star K
1
,n. Denition
1
.
2
A subset S
of
V (G) is called dominating set if for every v ∈ V − S, there exist a u ∈ S such that v is adjacent to u. Denition
1
.3 The minimum cardinality
of
a minimal dominating set
in
G is...
File link:
http://jaem.isikun.edu.tr/web/images/articles/vol.4.no.1/20.pdf
91%
Color class
domination
number
of
middle
graph
and
We give the color class
domination
number
of
the center
graph
and
middle
graph
of
K
1
,n ,
Cn
and
Pn
.
1
INTRODUCTION. By a
graph
we mean a finite, undirected
graph
without loops or multiple edges. Terms not defined here are used
in
the sense
of
Harary [
2
].
File link:
https://camo.ici.ro/journal/vol12/v12b8.pdf
90%
The Eigen-3-Cover Ratio
of
Graphs: Asymptotes,
Domination
and
All graphs
in
this paper are simple
and
loopless
and
on n vertices
and
m edges. We shall use the
graph
-theoretical notation
of
Harris, Hirst
and
ratio allows for the investigation
of
the
domination
effect
of
the energy
of
the 3-cover
graph
on the original energy
of
G, where a large number
of
vertices...
File link:
http://vixra.org/pdf/1504.0232v1.pdf
87%
Independent
Domination
in
Graphs: A Survey
3.
2
Domination
-Perfect Graphs. Towards a theory
of
domination
in
graphs. Networks, 7:247-26
1
, 1977. [24] E.J. Cockayne, S.T. Hedetniemi,
and
Miller D.J. Properties
of
hereditary hypergraphs
and
middle
graphs.
File link:
https://people.cs.clemson.edu/~goddard/papers/idomSurvey.pdf
71%
Eccentric
domination
in
splitting
graph
of
some
When G = Sp(Fn), G is a
graph
with radius
2
and
diameter
2
. D = {v, Eccentric
domination
in
splitting
graph
of
some
graphs
. degG(u) −
1
/
2
}, where the minimum is taken over all
central
vertices. Theorem:
2
.1
1
Let G be a self-centered
graph
with radius two
and
for...
File link:
http://www.ripublication.com/atam16/atamv11n2_09.pdf
70%
Fractional
Graph
Theory
In
a bipartite
graph
, Theorem
2
.
1
.
1
provides us a transversal K ⊆ V (G) whose cardinality is the same as that
of
a maximum matching. The
middle
levels problem is so-named because it deals with the
central
levels
of
the Boolean algebra
2
[2k+
1
].
File link:
https://www.ams.jhu.edu/ers/wp-content/uploads/sites/2/2015/12/fgt.pdf
66%
Edge Connected
Domination
Polynomial
of
a
Graph
The edge connected
domination
number
of
Pn
is m −
2
and
there is only one edge connected
domination
sets
of
size m For any cycle
graph
Cn
with n vertices
and
m edges, then. Let Yt be a
graph
obtained from Y
1
= K
1
,3 by identifying each end vertex
of
Yt−
1
with the
central
vertex
of
K
1
,
2
...
File link:
http://pjm.ppu.edu/sites/...JM_April2018_458to467.pdf
47%
Exponential
and
In
this unit we look at the graphs
of
exponential
and
logarithm functions,
and
see how they are related.
In
order to master the techniques explained here it is vital that you undertake plenty
of
practice exercises so that they become second nature.
File link:
http://www.mathcentre.ac....c-ty-explogfns-2009-1.pdf
46%
The figure above shows the
graph
of
the
graph
of
f ′ on the intervals [−
2
,
1
]
and
[
1
, 4] are 9
and
. 1
2
, respectively. (a) Find all x-coordinates at which f has a relative maximum. Give a reason for your answer. (b) On what open intervals contained
in
−3 < x < 4 is the
graph
of
f both concave down
and
decreasing?
File link:
http://secure-media.colle...l/ap15_calculus_ab_q5.pdf
46%
1
2
Next Page >>