Forcing edge detour monophonic number of a graph
For a connected graph $G=(V,E)$ of order at least two, an edge detour monophonic set of $G$ is a set $S$ of vertices such that every edge of $G$ lies on a detour monophonic path joining some pair of vertices in $S$. The edge detour monophonic number of $G$ is the minimum cardinality of its edge...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
University of Isfahan
2021-12-01
|
| Reeks: | Transactions on Combinatorics |
| Onderwerpen: | |
| Online toegang: | https://toc.ui.ac.ir/article_25622_c063c926a1ab86fa5bf537a4b45903ac.pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|