The upper open monophonic number of a graph
For a connected graph G of order n,a subset S of vertices of G is a monophonic set of G if each vertex v in G lies on a x-y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A monophonic set of...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2014
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000400003 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|