The forcing open monophonic number of a graph
For a connected graph G of order n ≥ 2, and for any mínimum open monophonic set S of G, a subset T of S is called a forcing subset for S if S is the unique minimum open monophonic set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing...
Saved in:
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000100005 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!