Kazan Federal University Digital Repository

On the doubly connected domination polynomial of a graph

Show simple item record

dc.date.accessioned 2019-01-22T20:50:20Z
dc.date.available 2019-01-22T20:50:20Z
dc.date.issued 2018
dc.identifier.issn 1793-5571
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/149034
dc.description.abstract © 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set (Formula presented.) is a doubly connected dominating set of (Formula presented.) if it is a dominating set and both induced subgraphs (Formula presented.) and (Formula presented.) are connected. In this paper, we introduce the doubly connected domination polynomial of a graph. We investigate some properties of these polynomials for some specific graphs. Also, we compute the doubly connected domination polynomial for some families of graphs such as the friendship graphs and the cactus chains graphs.
dc.relation.ispartofseries Asian-European Journal of Mathematics
dc.subject Cactus chain graph
dc.subject Domination polynomial
dc.subject doubly connected set
dc.subject friendship graph
dc.title On the doubly connected domination polynomial of a graph
dc.type Article in Press
dc.collection Публикации сотрудников КФУ
dc.source.id SCOPUS17935571-2018-SID85046436256

Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [22633]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace

Advanced Search


My Account