Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/114747
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | - |
| dc.creator | Cao, Y | - |
| dc.creator | Mou, G | - |
| dc.creator | Wang, J | - |
| dc.date.accessioned | 2025-08-25T02:01:28Z | - |
| dc.date.available | 2025-08-25T02:01:28Z | - |
| dc.identifier.issn | 0012-365X | - |
| dc.identifier.uri | http://hdl.handle.net/10397/114747 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Equimatchable | en_US |
| dc.subject | Strong product graph | en_US |
| dc.subject | Well-dominated | en_US |
| dc.subject | Well-edge-dominated | en_US |
| dc.title | On well (edge) dominated and equimatchable strong product graphs | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.volume | 349 | - |
| dc.identifier.issue | 1 | - |
| dc.identifier.doi | 10.1016/j.disc.2025.114718 | - |
| dcterms.abstract | A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated and equimatchable strong product graphs of nontrivial graphs, and identify a large family of graphs whose strong products with any well-dominated graph are well-dominated. | - |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | Discrete mathematics, Jan. 2026, v. 349, no. 1, 114718 | - |
| dcterms.isPartOf | Discrete mathematics | - |
| dcterms.issued | 2026-01 | - |
| dc.identifier.scopus | 2-s2.0-105012608669 | - |
| dc.identifier.eissn | 1872-681X | - |
| dc.identifier.artn | 114718 | - |
| dc.description.validate | 202508 bchy | - |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.SubFormID | G000060/2025-08 | en_US |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | Supported in part by the National Natural Science Foundation of China (NSFC) under grant 62372394 . | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2028-01-31 | en_US |
| dc.description.oaCategory | Green (AAM) | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Access
View full-text via PolyU eLinks 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.