Currently displaying 1 – 4 of 4

Showing per page

Order by Relevance | Title | Year of publication

Domination parameters of a graph with deleted special subset of edges

Maria Kwaśnik;  Maciej Zwierzchowski — 2001

Discussiones Mathematicae Graph Theory

This paper contains a number of estimations of the split domination number and the maximal domination number of a graph with a deleted subset of edges which induces a complete subgraph Kₚ. We discuss noncomplete graphs having or not having hanging vertices. In particular, for p = 2 the edge deleted graphs are considered. The motivation of these problems comes from [2] and [6], where the authors, among other things, gave the lower and upper bounds on irredundance, independence and domination numbers...

On (k,l)-kernels of special superdigraphs of Pₘ and Cₘ

Magdalena Kucharska;  Maria Kwaśnik — 2001

Discussiones Mathematicae Graph Theory

The concept of (k,l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [4] proved a sufficient condition for a digraph to have a (k,l)-kernel. The result generalizes the well-known theorem of P. Duchet and it is formulated in terms of symmetric pairs of arcs. Our aim is to give necessary and sufficient conditions for digraphs without symmetric pairs of arcs to have a (k,l)-kernel. We restrict our attention to special superdigraphs of digraphs Pₘ and Cₘ.

Page 1

Download Results (CSV)