The paired-domination and the upper paired-domination numbers of graphs

Włodzimierz Ulatowski

doi:10.7494/opmath.2015.35.1.127

The paired-domination and the upper paired-domination numbers of graphs

Abstract

In this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.

Citations

2

CrossRef
0

Web of Science
3

Scopus

Author (1)

Włodzimierz Ulatowski dr

Cite as

Full text

download paper

downloaded 33 times

Publication version: Accepted or Published Version
DOI:: Digital Object Identifier (open in new tab) 10.7494/OpMath.2015.35.1.127
License: open in new tab

full content of the article see on external site open in new tab

Keywords

Details

Category:: Articles
Type:: artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
Published in:: Opuscula Mathematica no. 35, edition 1, pages 127 - 135,
ISSN: 1232-9274
Language:: English
Publication year:: 2015
Bibliographic description:: Ulatowski W.: The paired-domination and the upper paired-domination numbers of graphs// Opuscula Mathematica. -Vol. 35., iss. 1 (2015), s.127-135
DOI:: Digital Object Identifier (open in new tab) 10.7494/opmath.2015.35.1.127
Verified by:: Gdańsk University of Technology