Logo BSU

Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/226492
Title: Характеризация совершенных доминантно-покрывающих графов
Authors: Зверович, И. Э.
Keywords: ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика
Issue Date: 1998
Publisher: Минск : Універсітэцкае
Citation: Вестник Белорусского государственного университета. Сер. 1, Физика. Математика. Информатика. – 1998. – № 3. – С. 59-61.
Abstract: A graph is called perfect dominant-covering if the domination number equals to the total point-covering number for any induced subgraph. A characterization of the perfect dominant-covering graphs is given in terms of forbidden induced subgraphs.
URI: http://elib.bsu.by/handle/123456789/226492
ISSN: 0321-0367
Licence: info:eu-repo/semantics/openAccess
Appears in Collections:1998, №3 (сентябрь)

Files in This Item:
File Description SizeFormat 
59-61.pdf655,35 kBAdobe PDFView/Open
Show full item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.