Domination polynomial of clique cover product of graphs

dc.contributor.author	Jahari, S.
dc.contributor.author	Alikhani, S.
dc.date.accessioned	2023-03-02T19:26:42Z
dc.date.available	2023-03-02T19:26:42Z
dc.date.issued	2019
dc.identifier.citation	Domination polynomial of clique cover product of graphs / S. Jahari, S. Alikhani // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 2. — С. 248–259. — Бібліогр.: 21 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC: 05C60, 05C69
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188492
dc.description.abstract	We study the D-equivalence classes of some families of graphs and, in particular, describe completely the D-equivalence classes of friendship graphs constructed by coalescing n copies of a cycle graph of length 3 with a common vertex.	uk_UA
dc.description.sponsorship	The authors acknowledge the financial support from Iran National Science Foundation (INSF), research project INSF-YAZD 96010014	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Domination polynomial of clique cover product of graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA