Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Arokiaraj, Andrew"'
A geodesic cover, also known as an isometric path cover, of a graph is a set of geodesics which cover the vertex set of the graph. An edge geodesic cover of a graph is a set of geodesics which cover the edge set of the graph. The geodesic (edge) cove
Externí odkaz:
http://arxiv.org/abs/2210.12675
The geodetic problem was introduced by Harary et al. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is al
Externí odkaz:
http://arxiv.org/abs/1708.03868
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 307-321 (2020)
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 d
Externí odkaz:
https://doaj.org/article/bda61bb38c1e42a58ded0d198a3b84ca
Publikováno v:
Open Mathematics, Vol 15, Iss 1, Pp 1225-1235 (2017)
Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95]. Here we introduce a variation of the geodetic problem and call it
Externí odkaz:
https://doaj.org/article/d3d285f52604453ab5d86a4d15185793
Publikováno v:
Open Mathematics, vol. 15, no. 1, pp. 1225-1235, 2017.
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1857::6bd7115620924512af4f19be32abf398
https://dk.um.si/Dokument.php?id=120001&dn=
https://dk.um.si/Dokument.php?id=120001&dn=