2025-02-23T11:25:06-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188492%22&qt=morelikethis&rows=5
2025-02-23T11:25:06-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-188492%22&qt=morelikethis&rows=5
2025-02-23T11:25:06-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T11:25:06-05:00 DEBUG: Deserialized SOLR response
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:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2019
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/188492 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
irk-123456789-188492 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1884922023-03-03T01:27:17Z Domination polynomial of clique cover product of graphs Jahari, S. Alikhani, S. 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. 2019 Article 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 http://dspace.nbuv.gov.ua/handle/123456789/188492 en Algebra and Discrete Mathematics Інститут прикладної математики і механіки НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| 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. |
| format |
Article |
| author |
Jahari, S. Alikhani, S. |
| spellingShingle |
Jahari, S. Alikhani, S. Domination polynomial of clique cover product of graphs Algebra and Discrete Mathematics |
| author_facet |
Jahari, S. Alikhani, S. |
| author_sort |
Jahari, S. |
| title |
Domination polynomial of clique cover product of graphs |
| title_short |
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_sort |
domination polynomial of clique cover product of graphs |
| publisher |
Інститут прикладної математики і механіки НАН України |
| publishDate |
2019 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/188492 |
| 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 назв. — англ. |
| series |
Algebra and Discrete Mathematics |
| work_keys_str_mv |
AT jaharis dominationpolynomialofcliquecoverproductofgraphs AT alikhanis dominationpolynomialofcliquecoverproductofgraphs |
| first_indexed |
2023-10-18T23:08:29Z |
| last_indexed |
2023-10-18T23:08:29Z |
| _version_ |
1796157353856335872 |