Iskanje po katalogu digitalne knjižnice

Opis: Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. Here we introduce a variation of the geodetic problem and call it strong edge geodetic problem. We illustrate how this problem is evolved from social transport networks. It is shown that the strong edge geodetic problem is NP-complete. We derive lower and upper bounds for the strong edge geodetic number and demonstrate that these bounds are sharp. We produce exact solutions for trees, block graphs, silicate networks and glued binary trees without randomization.
Ključne besede: geodetic problem, strong edge geodetic problem, computational complexity, transport networks
Objavljeno v DKUM: 03.11.2017; Ogledov: 1194; Prenosov: 445
Celotno besedilo (657,86 KB)
Gradivo ima več datotek! Več...