The week's pick
Random Articles
Reseach Article
An Interval Graph with Alternate Cliiques of Size 3- Signed Roman Domination
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 177 - Number 22 |
| Year of Publication: 2019 |
| Authors: M. Reddappa, C. Jaya Subba Reddy, B. Maheswari |
10.5120/ijca2019919655
|
M. Reddappa, C. Jaya Subba Reddy, B. Maheswari . An Interval Graph with Alternate Cliiques of Size 3- Signed Roman Domination. International Journal of Computer Applications. 177, 22 ( Dec 2019), 14-18. DOI=10.5120/ijca2019919655
Abstract
Today graph theory is one of the most flourishing braches of modern mathematics. Graphs are useful in enhancing the understanding of the organization and behavioural characteristics of complex system. The study of domination in graphs originated around 1850 has become the source of interest to the researchers. Interval graphs have drawn the attention of many researchers for over 40 years. They form a special class of graphs with many interesting properties and revealed their practical relevance for modeling problems arising in the real world. The theory of domination in graphs introduced by Ore [11] and Berge [6] is fast growing area of research in graph theory today. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et.al. [1, 2]. The concept of signed Roman dominating function was introduced by Ahangar et al. [4]. They present various lower and upper bounds on the signed Roman domination number of a graph and characterized the graphs which have these bounds. The minimal signed Roman dominating functions of corona product graph of a path with a star is studied by Siva Parvathi [13]. In this paper a study of signed Roman domination in an interval graph with alternate cliques of size 3 is carried out.
References
- Haynes, T.W., Hedetniemi, S.T., and Slater, P.J. 1998. Domination in graphs: Advanced Topics, Marcel Dekkar, Inc., New York.
- Haynes, T.W., Hedetniemi, S.T., and Slater, P.J.1998. Fundamentals of domination in graphs, Marcel Dekkar, Inc., New York.
- Dunbar.J., Hedetniemi.S.T., Henning, M.A. and Slater, P.J. 1995.Signed domination in graphs, in: Y. Alari and A. Schwenk (Eds.), Proc. 7thInternat. Conf.on the Theory and Applications of Graphs, Wiley, New York, 311 – 321.
- Ahangar, H.A., Henning, M.A., Zhao, Y., Lowenstein, C., Samodivkin, V. 2012. Signed Roman domination in graphs, J.Comb.Optim.
- Allan, R.B. and Laskar, R.C. 1978. On domination, Independent domination numbers of a graph Discrete Math., 23, 73-76.
- Berge, C. 1980. Graphs and Hyperactive graphs, North Holland, Amsterdam in graphs, Networks, 10,211 – 215.
- Cockayne, E.J. and Hedetniemi, S.T. 1977. Towards a theory of domination in graphs. Networks 7, 247 -261.
- Cockayne, E.J. Dreyer, P.A., Hedetniemi, S.M., and Hedetniemi, S.T. 2004. Roman domination in graphs, Discrete math., 278, 11 -22.
- Ian Stewart. 1999. Defend the Roman Empire!., Scientific American, 281(6), 136 -139.
- Jaya Subba Reddy. C., Reddappa, M., and Maheswari. B. 2019. Roman domination in a certain type of interval graph, International Journal of Research and analytical Reviews, 6(1), 665–672.
- Ore, O. 1962. Theory of Graphs, Amer, Math.Soc. Collaq.Publ.38, Providence.
- ReValle, C.S., and Rosing K,E. 2000. Defenden imperiumromanum: a classical problem in military.
- SivaParvathi, M and Maheswari, B. 2016. Minimal Signed Roman dominating functions of a corona product Graph of a path with star – International Journal of Mathematics and computer Applications Research, 6(2), 67 – 72.
Index Terms
Keywords