Domination, independence and irredundance in graphs

Jerzy Topp

  • Publisher: Instytut Matematyczny Polskiej Akademi Nauk(Warszawa), 1995

Abstract

top
CONTENTS1. Introduction........................................................................................................ 5 1.1. Purpose and scope................................................................................. 5 1.2. Basic graphtheoretical terms................................................................ 62. Domination, independence and irredundance in graphs................................ 9 2.1. Introduction and preliminaries.............................................................. 9 2.2. Domination parameters of vertex and edgedeleted subgraphs..... 15 2.3. Packing and covering numbers............................................................ 25 2.4. Conditions for equalities of domination parameters........................ 353. Well covered graphs........................................................................................ 46 3.1. Introduction and preliminary results..................................................... 46 3.2. The well coveredness of products of graphs..................................... 55 3.3. Well covered simplicial and chordal graphs...................................... 67 3.4. Well covered line and total graphs....................................................... 73 3.5. Well covered generalized Petersen graphs........................................ 78 3.6. Well irredundant graphs......................................................................... 804. Graphical sequences and sets of integers......................................................... 85 4.1. Dominationfeasible sequences........................................................... 86 4.2. Interpolation properties of domination parameters.......................... 91References.................................................................................................................... 94

How to cite

top

Jerzy Topp. Domination, independence and irredundance in graphs. Warszawa: Instytut Matematyczny Polskiej Akademi Nauk, 1995. <http://eudml.org/doc/268493>.

@book{JerzyTopp1995,
abstract = {CONTENTS1. Introduction........................................................................................................ 5 1.1. Purpose and scope................................................................................. 5 1.2. Basic graphtheoretical terms................................................................ 62. Domination, independence and irredundance in graphs................................ 9 2.1. Introduction and preliminaries.............................................................. 9 2.2. Domination parameters of vertex and edgedeleted subgraphs..... 15 2.3. Packing and covering numbers............................................................ 25 2.4. Conditions for equalities of domination parameters........................ 353. Well covered graphs........................................................................................ 46 3.1. Introduction and preliminary results..................................................... 46 3.2. The well coveredness of products of graphs..................................... 55 3.3. Well covered simplicial and chordal graphs...................................... 67 3.4. Well covered line and total graphs....................................................... 73 3.5. Well covered generalized Petersen graphs........................................ 78 3.6. Well irredundant graphs......................................................................... 804. Graphical sequences and sets of integers......................................................... 85 4.1. Dominationfeasible sequences........................................................... 86 4.2. Interpolation properties of domination parameters.......................... 91References.................................................................................................................... 94},
author = {Jerzy Topp},
keywords = {graph; domination; independence; irredundance; well coveredness; interpolation; well-covered graphs; characterizations},
language = {eng},
location = {Warszawa},
publisher = {Instytut Matematyczny Polskiej Akademi Nauk},
title = {Domination, independence and irredundance in graphs},
url = {http://eudml.org/doc/268493},
year = {1995},
}

TY - BOOK
AU - Jerzy Topp
TI - Domination, independence and irredundance in graphs
PY - 1995
CY - Warszawa
PB - Instytut Matematyczny Polskiej Akademi Nauk
AB - CONTENTS1. Introduction........................................................................................................ 5 1.1. Purpose and scope................................................................................. 5 1.2. Basic graphtheoretical terms................................................................ 62. Domination, independence and irredundance in graphs................................ 9 2.1. Introduction and preliminaries.............................................................. 9 2.2. Domination parameters of vertex and edgedeleted subgraphs..... 15 2.3. Packing and covering numbers............................................................ 25 2.4. Conditions for equalities of domination parameters........................ 353. Well covered graphs........................................................................................ 46 3.1. Introduction and preliminary results..................................................... 46 3.2. The well coveredness of products of graphs..................................... 55 3.3. Well covered simplicial and chordal graphs...................................... 67 3.4. Well covered line and total graphs....................................................... 73 3.5. Well covered generalized Petersen graphs........................................ 78 3.6. Well irredundant graphs......................................................................... 804. Graphical sequences and sets of integers......................................................... 85 4.1. Dominationfeasible sequences........................................................... 86 4.2. Interpolation properties of domination parameters.......................... 91References.................................................................................................................... 94
LA - eng
KW - graph; domination; independence; irredundance; well coveredness; interpolation; well-covered graphs; characterizations
UR - http://eudml.org/doc/268493
ER -

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.