Connected edge monophonic number of a graph
For a connected graph G of order n,a set S of vertices is called an edge monophonic set of G if every edge of G lies on a monophonic path joining some pair of vertices in S, and the edge monophonic number m e(G) is the minimum cardinality of an edge monophonic set. An edge monophonic set S of G is a...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2013
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172013000300002 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|