CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Co-regular Edge Domination in Graphs

by M. H. Muddebihal, Priyanka H. Mandarvadkar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 176 - Number 29
Year of Publication: 2020
Authors: M. H. Muddebihal, Priyanka H. Mandarvadkar
10.5120/ijca2020920339

M. H. Muddebihal, Priyanka H. Mandarvadkar . Co-regular Edge Domination in Graphs. International Journal of Computer Applications. 176, 29 ( Jun 2020), 42-45. DOI=10.5120/ijca2020920339

@article{ 10.5120/ijca2020920339,
author = { M. H. Muddebihal, Priyanka H. Mandarvadkar },
title = { Co-regular Edge Domination in Graphs },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2020 },
volume = { 176 },
number = { 29 },
month = { Jun },
year = { 2020 },
issn = { 0975-8887 },
pages = { 42-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume176/number29/31387-2020920339/ },
doi = { 10.5120/ijca2020920339 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:43:49.065272+05:30
%A M. H. Muddebihal
%A Priyanka H. Mandarvadkar
%T Co-regular Edge Domination in Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 29
%P 42-45
%D 2020
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An edge dominating set

References
  1. Araya chaemchan, The edge domination number of connected graphs, Australasian Journal of Combinatorics, Vol 48, 185-189.
  2. S. Arumugam and S. Velammal, 1998. Edge domination in graphs, Taiwanese J. of Mathematics,2(2), 173 – 179.
  3. S. Arumugam and S. Velammal, 2009. Connected edge domination in graphs, Allahabad Mathematical Society, Vol 24,part, 43-49.
  4. C. Berge, 1962. Theory of graphs and its applications, Methuen, London,.
  5. E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, 1980. Total domination in graphs, Networks, 10, 211 – 219.
  6. G. S. Domke, J. H. Hattingh, S. T. Hedetniemi, R. C. Laskar and L. R. Markus, 1997. Restrained domination in graphs, Discrete Math., 203, 61 – 69.
  7. F. Harary, 1969. Graph theory, Adison Wesley, Reading Mass.
  8. T.W. Haynes, S. T. Hedetniemi and P. J. Slater, 1997. Domination in graphs: Advanced topics, Marcel Dekker, Inc., New York.
  9. F. Harary and T. W. Haynes, 2000. Double domination in graphs Ars Combin Vol 55, 201-213.
  10. V. R. Kulli, 2010. Theory of domination in graph, Vishwa international publications, India.
  11. S. Mitchell and S. T. Hedetniemi, 1977. Edge domination in trees, Congr. Numer, 19, 489 – 509.
  12. M. H. Muddebihal and Priyanka .H. Mandarvadkar, 2019. Co-regular split domination in graphs. JES, Vol-10, 259-264.
  13. M. H. Muddebihal and Priyanka. H. Mandarvadkar, 2020. Co-regular restrained domination in graphs. CEJ,Vol -11, 236-241.
  14. M. H. Muddebihal and Priyanka. H. Mandarvadkar, 2020. Co-regular total domination in graphs. International Journal of Applied Information Systems (IJAIS) Vol-12 16-19.
  15. O.Ore,1962. Theory of graphs, Amer. Math.Soc.Colloq.Publ. 38. Providence, RI.
Index Terms

Computer Science
Information Sciences

Keywords

Graph Edge domination number Coregular edge domination number. Subject classified number: AMS-05C69 05C70.

Powered by PhDFocusTM