| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Strong geodetic problem in networks
Authors:ID Manuel, Paul (Author)
ID Klavžar, Sandi (Author)
ID Xavier, Antony (Author)
ID Arokiaraj, Andrew (Author)
ID Thomas, Elizabeth (Author)
Files:.pdf Manuel-2020-STRONG_GEODETIC_PROBLEM_IN_NETWORK.pdf (162,66 KB)
MD5: 6F794C14B4C1408FAB8D2268C065236A
 
URL https://doi.org/10.7151/dmgt.2139
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced. The problem is conceptually similar to the classical geodetic problem but seems intrinsically more difficult. The strong geodetic number is compared with the geodetic number and with the isometric path number. It is determined for several families of graphs including Apollonian networks. Applying Sierpiński graphs, an algorithm is developed that returns a minimum path cover of Apollonian networks corresponding to the strong geodetic number. It is also proved that the strong geodetic problem is NP-complete.
Keywords:geodetic problem, strong geodetic problem, Apollonian networks, Sierpiński graphs, computational complexity
Publication status:Published
Publication version:Version of Record
Submitted for review:17.07.2017
Article acceptance date:19.03.2018
Publisher:Technical University Press
Year of publishing:2020
Number of pages:Str. 307-321
Numbering:Letn. 40, št. 1
PID:20.500.12556/DKUM-92014 New window
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:18817113 New window
DOI:10.7151/dmgt.2139 New window
Publication date in DKUM:11.03.2025
Views:103
Downloads:7
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Title:Krepko geodetski problem na omrežjih
Abstract:Z namenom modeliranja določenih problemov v socialnih omrežjih je v članku vpeljan krepko geodetski problem in pripadajoča grafovska invarianta krepko geodetsko število. Problem je konceptualno podoben klasičnemu geodetskemu problemu, a se vseeno zdi intrinzično zahtevnejši. Krepko geodetsko število je primerjano z geodetskim številom in s številom izometričnih poti. Krepko geodetsko število je določeno za več družin grafov, med drugim za Apollonijeva omrežja. Z uporabo grafov Sierpińskega je razvit algoritem, ki vrne minimalno pokritje s potmi Apollonijevih omrežij, ki ustreza krepko geodetskemu številu. Dokazano je tudi, da je krepko geodetski problem NP-poln.
Keywords:geodetski problem, krepko geodetski problem, Apollonijeva omrežja, grafi Sierpińskega, računska zahtevnost


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica