| dc.creator | Santhakumaran, A. P. | |
| dc.creator | Titus, P. | |
| dc.creator | Ganesamoorthy, K. | |
| dc.creator | Murugan, M. | |
| dc.date | 2021-03-15 | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3483 | |
| dc.identifier | 10.22199/issn.0717-6279-2021-02-0031 | |
| dc.description | For a connected graph G = (V, E) of order at least two, a subset T of a minimum total monophonic set S of G is a forcing total monophonic subset for S if S is the unique minimum total monophonic set containing T . A forcing total monophonic subset for S of minimum cardinality is a minimum forcing total monophonic subset of S. The forcing total monophonic number ftm(S) in G is the cardinality of a minimum forcing total monophonic subset of S. The forcing total monophonic number of G is ftm(G) = min{ftm(S)}, where the minimum is taken over all minimum total monophonic sets S in G. We determine bounds for it and find the forcing total monophonic number of certain classes of graphs. It is shown that for every pair a, b of positive integers with 0 ≤ a < b and b ≥ a+4, there exists a connected graph G such that ftm(G) = a and mt(G) = b. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3483/3702 | |
| dc.rights | Copyright (c) 2021 A. P. Santhakumaran, P. Titus, K. Ganesamoorthy, M. Murugan | en-US |
| dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 40 No. 2 (2021); 561-571 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 40 Núm. 2 (2021); 561-571 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2021-02 | |
| dc.subject | Total monophonic set | en-US |
| dc.subject | Total monophonic number | en-US |
| dc.subject | Forcing total monophonic subset | en-US |
| dc.subject | Forcing total monophonic number | en-US |
| dc.subject | 05C12 | en-US |
| dc.title | The forcing total monophonic number of a graph | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
