Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Dominating Set
Domination Number
Related Publications
(2)
R Domination in Graphs
Domination in Graphs: Advanced Topics
Subscribe
Academic
Publications
Strong weak domination and domination balance in a graph
Strong weak domination and domination balance in a graph,10.1016/0012365X(95)00231K,Discrete Mathematics,E. Sampathkumar,L. Pushpa Latha
Edit
Strong weak domination and domination balance in a graph
(
Citations: 6
)
BibTex

RIS

RefWorks
Download
E. Sampathkumar
,
L. Pushpa Latha
Let G = (V, E) be a graph and u, v ~ V. Then, u strongly dominates v and v weakly dominates u if (i) uv ~ E and (ii) deg u >/deg v. A set D c V is a strongdominating set (sdset) of G if every vertex in V  D is strongly dominated by at least one vertex in D. Similarly, a weakdominating set (wdset) is defined. The strong (weak)
domination number
7s (7w) of G is the minimum cardinality of an sdset (wdset). Besides investigating some relationship of ?s and ?w with other known parameters of G, some bounds are obtained. A graph G is domination balanced if there exists an sdset D1 and a wdset/)2 such that D1 c~D2 = 0. A study of domination balanced graphs is initiated.
Journal:
Discrete Mathematics  DM
, vol. 161, no. 13, pp. 235242, 1996
DOI:
10.1016/0012365X(95)00231K
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
(
linkinghub.elsevier.com
)
(
dx.doi.org
)
(
shyam.nitk.ac.in
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(3)
...i) the induced subgraphhSi is connected, then S is a connected dominating set (Sampathkumar and Walikar [
14
]);...
...iii) for all u2 V S, there exists a vertex v2 S such that uv2 E and deg(v) deg(u), then S is called a strong dominating set, and S is a weak dominating set if, for all u 2 V S, there exists a vertex v 2 S such that uv 2 E and deg(v) deg(u) (Pushpa Latha and Sampathkumar [
14
])...
S. Balasubramanian
,
et al.
Gallai Theorems Involving Domination Parameters
...The strong domination and independent strong domination numbers were studied in [6, 9, 13, 14,
16
]...
...Corollary 1 (Sampathkumar and Pushpa Latha [
16
]) Any K1;3free graph is strong domination perfect...
...The weak domination number ∞W(G) is the minimum cardinality of a weak dominating set of G, and the independent weak domination number iW(G) is the minimum cardinality of an independent weak dominating set of G. Other results on these parameters can be found in [7, 8, 9, 15,
16
]...
...It was proved in [
16
] that any K1;3graph is weak domination perfect...
Dieter Rautenbach
,
et al.
Perfect graphs of strong domination and independent strong domination
...The strong domination and independent strong domination numbers were studied in [6,9,13,14,
16
]...
...Corollary 1 (Sampathkumar and Pushpa Latha [
16
])...
...It was proved in [
16
] that any K1;3graph is weak domination perfect...
D. Rautenbach
,
et al.
Perfect graphs of strong domination and independent strong domination
References
(6)
On domination and independent domination number of graphs
(
Citations: 14
)
R. B. Allan
,
R. C. Laskar
Journal:
Discrete Mathematics  DM
, 1978
Towards a theory of domination in graphs
(
Citations: 69
)
E. J. Cockayne
,
S. T. Hedetniemi
Journal:
Networks
, vol. 7, no. 3, pp. 247261, 1977
Bibliography on domination in graphs and some basic definitions of domination parameters
(
Citations: 24
)
Stephen T. Hedetniemi
,
Renu C. Laskar
Journal:
Discrete Mathematics  DM
, vol. 86, no. 13, pp. 257277, 1990
On weak domination in graphs
(
Citations: 4
)
Johannes H. Hattingh
,
Renu Laskar
Journal:
Ars Combinatoria  ARSCOM
, vol. 49, 1998
On domination and independent domination numbers of a graph
(
Citations: 36
)
R Allan
Journal:
Discrete Mathematics  DM
, vol. 23, no. 2, pp. 7376, 1978
Sort by:
Citations
(6)
On strong (weak) independent sets and vertex coverings of a graph
S. S. Kamath
,
R. S. Bhat
Journal:
Discrete Mathematics  DM
, vol. 307, no. 910, pp. 11361145, 2007
Weak edgedegree domination in hypergraphs
Belmannu Devadas Acharya
,
Purnima Gupta
Journal:
Czechoslovak Mathematical Journal  CZECH MATH J
, vol. 56, no. 1, pp. 99108, 2006
Gallai Theorems Involving Domination Parameters
(
Citations: 1
)
S. Balasubramanian
,
J. Farr
,
K. Bernasconi
,
R. Laskar
,
J. Villalpando
,
K. Hutson
,
G. Stevens
,
M. Gairing
,
S. T. Hedetniemi
Published in 2002.
Perfect graphs of strong domination and independent strong domination
(
Citations: 4
)
Dieter Rautenbach
,
Vadim E. Zverovich
Journal:
Discrete Mathematics  DM
, vol. 226, no. 13, pp. 297311, 2001
The influence of special vertices on strong domination
(
Citations: 2
)
Dieter Rautenbach
Journal:
Discrete Mathematics  DM
, vol. 197198, no. 13, pp. 683690, 1999