The forcing total restrained geodetic number and the total restrained geodetic number of a graph: Realizability and complexity
Given two vertices and of a nontrivial connected graph , the set consists all vertices lying on some geodesic in , including and . For , the set is the union of all sets for . A set is a total restrained geodetic set of if and the subgraphs induced by and have no isolated vertex. The minimum cardina...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.03.007 |