Dominant-matching graphs

Igor' E. Zverovich; Olga I. Zverovich

Discussiones Mathematicae Graph Theory (2004)

  • Volume: 24, Issue: 3, page 485-490
  • ISSN: 2083-5892

Abstract

top
We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.

How to cite

top

Igor' E. Zverovich, and Olga I. Zverovich. "Dominant-matching graphs." Discussiones Mathematicae Graph Theory 24.3 (2004): 485-490. <http://eudml.org/doc/270201>.

@article{IgorE2004,
abstract = {We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.},
author = {Igor' E. Zverovich, Olga I. Zverovich},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {domination number; matching number; hereditary class of graphs},
language = {eng},
number = {3},
pages = {485-490},
title = {Dominant-matching graphs},
url = {http://eudml.org/doc/270201},
volume = {24},
year = {2004},
}

TY - JOUR
AU - Igor' E. Zverovich
AU - Olga I. Zverovich
TI - Dominant-matching graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 3
SP - 485
EP - 490
AB - We introduce a new hereditary class of graphs, the dominant-matching graphs, and we characterize it in terms of forbidden induced subgraphs.
LA - eng
KW - domination number; matching number; hereditary class of graphs
UR - http://eudml.org/doc/270201
ER -

References

top
  1. [1] L. Lovász and M. Plummer, Matching Theory, North-Holland Math. Stud. 121, Annals Discrete Math. 29 (North-Holland Publ. Co., Amsterdam-New York; Akad. Kiadó, Budapest, 1986) xxvii+544 pp. 
  2. [2] L. Volkmann, On graphs with equal domination and edge independence numbers, Ars Combin. 41 (1995) 45-56. Zbl0842.05052
  3. [3] I.E. Zverovich, k-bounded classes of dominant-independent perfect graphs, J. Graph Theory 32 (1999) 303-310, doi: 10.1002/(SICI)1097-0118(199911)32:3<303::AID-JGT8>3.0.CO;2-B Zbl0944.05073
  4. [4] I.E. Zverovich, Perfect connected-dominant graphs, Discuss. Math. Graph Theory 23 (2003) 159-162, doi: 10.7151/dmgt.1192. Zbl1037.05038
  5. [5] I.E. Zverovich and V.E. Zverovich, A semi-induced subgraph characterization of upper domination perfect graphs, J. Graph Theory 31 (1999) 29-49, doi: 10.1002/(SICI)1097-0118(199905)31:1<29::AID-JGT4>3.0.CO;2-G Zbl0920.05060
  6. [6] I.E. Zverovich and V.E. Zverovich, An induced subgraph characterization of domination perfect graphs, J. Graph Theory 20 (1995) 375-395, doi: 10.1002/jgt.3190200313. Zbl0836.05067

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.