The forcing monophonic and forcing geodetic numbers of a graph
<p>For a connected graph G = (V, E), let a set S be a m-set of G. A subset T ⊆ S is called a forcing subset for S if S is the unique m-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing monophonic number of S, denoted by fm(S), is the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2020-12-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://ijc.or.id/index.php/ijc/article/view/127 |