The forcing vertex detour monophonic number of a graph
For any two vertices x and y in a connected graph G, an x–y path is a monophonic path if it contains no chord, and a longest x–y monophonic path is called an x–y detour monophonic path. For any vertex x in G, a set Sx⊆V(G) is an x-detour monophonic set of G if each vertex v∈V(G) lies on an x–y detou...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-04-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016300287 |