Upper Edge Detour Monophonic Number of a Graph
For a connected graph G of order at least two, a path P is called a monophonic path if it is a chordless path. A longest x - y monophonic path is called an x - y detour monophonic path. A set S of vertices of G is an edge detour monophonic set of G if every edge of G lies on a detour monophonic path...
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-09172014000200004 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|