Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ullas Chandran S. V."'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 935-939 (2020)
Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set S of vertices in a graph G is a general position set if no
Externí odkaz:
https://doaj.org/article/b3e2b9c723b84e0cb1981a27e850c2ba
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bcdc37da51269971dd326aace567edb
https://doi.org/10.1007/978-3-030-95018-7_4
https://doi.org/10.1007/978-3-030-95018-7_4
Autor:
Santhakumaran, A. P.1 apskumar1953@gmail.com, Ullas Chandran, S. V.2 svuc.math@gmail.com
Publikováno v:
Proyecciones - Journal of Mathematics. Dec2015, Vol. 34 Issue 4, p343-350. 8p.
Publikováno v:
Scopus-Elsevier
For vertices u and v in a connected graph G = (V, E), the set ID[u, v] consists of all those vertices lying on a u−v longest path in G. Given a set S of vertices of G, the union of all sets ID[u, v] for u, v ∈ S, is denoted by ID[S]. A set S is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::50838a68f0e5c89a76d77ba25cbbf5a5
http://www.scopus.com/inward/record.url?eid=2-s2.0-84873289861&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84873289861&partnerID=MN8TOARS