The forcing total monophonic number of a graph
Abstract 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 f...
Saved in:
| Main Authors: | , , , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000200561 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|