The upper edge geodetic number and the forcing edge geodetic number of a graph
An edge geodetic set of a connected graph \(G\) of order \(p \geq 2\) is a set \(S \subseteq V(G)\) such that every edge of \(G\) is contained in a geodesic joining some pair of vertices in \(S\). The edge geodetic number \(g_1(G)\) of \(G\) is the minimum cardinality of its edge geodetic sets and a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2009-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol29/4/art/opuscula_math_2934.pdf |