Domination polynomial of clique cover product of graphs
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.
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2019 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2019
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/188492 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862749125859082240 |
|---|---|
| author | Jahari, S. Alikhani, S. |
| author_facet | Jahari, S. Alikhani, S. |
| citation_txt | Domination polynomial of clique cover product of graphs / S. Jahari, S. Alikhani // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 2. — С. 248–259. — Бібліогр.: 21 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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.
|
| first_indexed | 2025-12-07T20:58:33Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-188492 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-07T20:58:33Z |
| publishDate | 2019 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Jahari, S. Alikhani, S. 2023-03-02T19:26:42Z 2023-03-02T19:26:42Z 2019 Domination polynomial of clique cover product of graphs / S. Jahari, S. Alikhani // Algebra and Discrete Mathematics. — 2019. — Vol. 28, № 2. — С. 248–259. — Бібліогр.: 21 назв. — англ. 1726-3255 2010 MSC: 05C60, 05C69 https://nasplib.isofts.kiev.ua/handle/123456789/188492 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. The authors acknowledge the financial support from Iran National Science Foundation (INSF), research project INSF-YAZD 96010014 en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Domination polynomial of clique cover product of graphs Article published earlier |
| spellingShingle | Domination polynomial of clique cover product of graphs Jahari, S. Alikhani, S. |
| title | Domination polynomial of clique cover product of graphs |
| title_full | Domination polynomial of clique cover product of graphs |
| title_fullStr | Domination polynomial of clique cover product of graphs |
| title_full_unstemmed | Domination polynomial of clique cover product of graphs |
| title_short | Domination polynomial of clique cover product of graphs |
| title_sort | domination polynomial of clique cover product of graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/188492 |
| work_keys_str_mv | AT jaharis dominationpolynomialofcliquecoverproductofgraphs AT alikhanis dominationpolynomialofcliquecoverproductofgraphs |