Weak edge-degree domination in hypergraphs

Belmannu Devadas Acharya; Purnima Gupta

Czechoslovak Mathematical Journal (2006)

  • Volume: 56, Issue: 1, page 99-108
  • ISSN: 0011-4642

Abstract

top
In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given hypergraph.

How to cite

top

Acharya, Belmannu Devadas, and Gupta, Purnima. "Weak edge-degree domination in hypergraphs." Czechoslovak Mathematical Journal 56.1 (2006): 99-108. <http://eudml.org/doc/31019>.

@article{Acharya2006,
abstract = {In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given hypergraph.},
author = {Acharya, Belmannu Devadas, Gupta, Purnima},
journal = {Czechoslovak Mathematical Journal},
keywords = {hypergraph; weak degree domination number; independent domination number; graph theory; hypergraph; weak degree domination number; independent domination number; graph theory},
language = {eng},
number = {1},
pages = {99-108},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Weak edge-degree domination in hypergraphs},
url = {http://eudml.org/doc/31019},
volume = {56},
year = {2006},
}

TY - JOUR
AU - Acharya, Belmannu Devadas
AU - Gupta, Purnima
TI - Weak edge-degree domination in hypergraphs
JO - Czechoslovak Mathematical Journal
PY - 2006
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 56
IS - 1
SP - 99
EP - 108
AB - In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given hypergraph.
LA - eng
KW - hypergraph; weak degree domination number; independent domination number; graph theory; hypergraph; weak degree domination number; independent domination number; graph theory
UR - http://eudml.org/doc/31019
ER -

References

top
  1. Contributions to the theories of hypergraphs, graphoids and graphs, PhD.  Thesis, Indian Institute of Technology, Bombay, 1975. (1975) 
  2. Separability and acyclicity in hypergraphs, In: Proceedings of the Symposium on Graph Theory. ISI Lecture Notes in Mathematics, No. 4 (A. R.  Rao, ed.), The Macmillan Comp., Calcutta, 1979, pp. 65–83. (1979) Zbl0483.05051MR0553933
  3. 10.1016/0012-365X(79)90103-1, Discrete Mathematics 27 (1979), 111–116. (1979) Zbl0407.05066MR0537468DOI10.1016/0012-365X(79)90103-1
  4. 10.1016/0095-8956(82)90056-9, J.  Combinatorial Theory, Ser.  B 33 (1982), 52–56. (1982) MR0678170DOI10.1016/0095-8956(82)90056-9
  5. Full sets in hypergraphs, Sankhya: The Indian J.  Statistics. Special Vol. 54 (1992), 1–6. (1992) Zbl0882.05099MR1234671
  6. Strongly Helly hypergraphs, J.  Ramanujan Math. Soc. 11 (1996), 139–144. (1996) Zbl0867.05050MR1429306
  7. A direct inductive proof of a conjecture due to E.  Sampathkumar and L.  Pushpa Latha, Nat. Acad. Sci.-Letters 21 (1998), 84–90. (1998) MR1639204
  8. Graphs and Hypergraphs, North-Holland Elsevier Publ., Amsterdam, 1973. (1973) Zbl0254.05101MR0357172
  9. Hypergraphs, North-Holland Elsevier Publ., Amsterdam, 1989. (1989) Zbl0674.05001MR1013569
  10. 10.1016/S0012-365X(97)00133-7, Discrete Mathematics 182 (1998), 53–67. (1998) MR1603720DOI10.1016/S0012-365X(97)00133-7
  11. Odd cycles and θ -cycles in hypergraphs, “Paul Erdös and his Mathematics: Research Communications”, Janos Bolyayi Mathematical Society, Budapest, 1990, pp. 96–98. (1990) MR1901889
  12. On weak domination in graphs, Ars Comb. 49 (1998), 205–216. (1998) MR1633119
  13. Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998. (1998) MR1605684
  14. 10.1016/0095-8956(76)90070-8, J.  Combinatorial Theory, Ser.  B 20 (1976), 80–83. (1976) Zbl0335.05135MR0429653DOI10.1016/0095-8956(76)90070-8
  15. Bounds on the weak domination number, Australas. J. Comb. 18 (1998), 245–251. (1998) Zbl0914.05041MR1658286
  16. 10.1016/0012-365X(95)00231-K, Discrete Mathematics 161 (1996), 235–242. (1996) MR1420536DOI10.1016/0012-365X(95)00231-K
  17. Introduction to Graph Theory, Prentice Hall, New Jersey, 1996. (1996) Zbl0845.05001MR1367739

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.