Domination polynomial of clique cover product of graphs

• Published in: Algebra and Discrete Mathematics
• Date: 2019
• Main Authors: Jahari, S., Alikhani, S.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2019
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/188492
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: Domination polynomial of clique cover product of graphs / S. Jahari, S. Alikhani // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 2. — С. 248–259. — Бібліогр.: 21 назв. — англ.

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.