Research Article
Weak Domination in LICT Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 176 - Issue 11 |
| Published: Apr 2020 |
| Authors: M. H. Muddebihal, Geetadevi Baburao |
10.5120/ijca2020920023
|
M. H. Muddebihal, Geetadevi Baburao . Weak Domination in LICT Graphs. International Journal of Computer Applications. 176, 11 (Apr 2020), 13-16. DOI=10.5120/ijca2020920023
@article{ 10.5120/ijca2020920023,
author = { M. H. Muddebihal,Geetadevi Baburao },
title = { Weak Domination in LICT Graphs },
journal = { International Journal of Computer Applications },
year = { 2020 },
volume = { 176 },
number = { 11 },
pages = { 13-16 },
doi = { 10.5120/ijca2020920023 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2020
%A M. H. Muddebihal
%A Geetadevi Baburao
%T Weak Domination in LICT Graphs%T
%J International Journal of Computer Applications
%V 176
%N 11
%P 13-16
%R 10.5120/ijca2020920023
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The lict graph n(G) of a graph G is the graph whose set of vertices is the union of set of edges and the set of cut vertices of G in which two vertices are adjacent if and only if the corresponding edges are adjacent or the corresponding members of G are incident.In this paper, we initiate the study of variation of standard domination, namely weak lict domination. A weak dominating set D is a weak dominating set of n(G), if for every vertex y∈V[n(G) ]-D there is a vertex x∈D with deg(x)≤deg(y) and y is adjacent to x. A weak domination number of n(G) is denoted by γ_wn (G), is the smallest cardinality of a weak dominating set of n(G). We determine best possible upper and lower bounds for γ_wn (G), in terms of elements of G.
References
- F. Harary, Graph Theory, Addison-Wesley, Reading Mass, 1974.
- F. Harary and T. W. Haynes, Double domination in graphs, Ars combin, Vol-55, 2000, 201- 213
- T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graph, Marcell Dekker, INC-1998.
- T. W. Haynes, S. T. Hedetniemi, P. J. Slater (Eds), Domination in graph: Advanced Topics, Marcel Dekker, INC, New York, 1998.
- V.R. Kulli, Theory of domination in Graphs, Viswa international publications, 2010.
- V R. Kulli and M. H. Muddebihal Lict and Litact graph of a graphs, journal of analysis and computation, Vol-2, 2006, 133-143.
- M. H. Muddebihal and Geetadevi Baburao, weak line domination in graph theory, IJRAR Vol-6, 2019, 129-133.
- E. Sampathkumar and Puspa Latha, strong weak domination number and domination balance in graph, Discrete Math, Vol-161, 1996, 235-242.
Index Terms
Keywords