2025-02-23T10:47:38-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-23T10:47:38-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-23T10:47:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T10:47:38-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!
|