Zobrazeno 1 - 10
of 18
pro vyhledávání: '"S. V., ULLAS CHANDRAN"'
A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the general position achievement game. The game is played on a graph $G$ by
Externí odkaz:
http://arxiv.org/abs/2111.07425
Autor:
THANKACHY, MAYA G. S.1 mayagsthankachy@gmail.com, S. V., ULLAS CHANDRAN1 svuc.math@gmail.com, TUITE, JAMES2 james.t.tuite@open.ac.uk, THOMAS, ELIAS JOHN3 eliasjohnkalarickal@gmail.com, DI STEFANO, GABRIELE4 gabriele.distefano@univaq.it, ERSKINE, GRAHAME2 grahame.erskine@open.ac.uk
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 3, p1169-1188. 20p.
Autor:
K., Neethu P., S. V, Ullas Chandran
A set of vertices $S$ of a graph $G$ is a (geodesic)convex set, if $S$ contains all the vertices belonging to any shortest path connecting between two vertices of $S$. The cardinality of maximum proper convex set of $G$ is called the convexity number
Externí odkaz:
http://arxiv.org/abs/2004.04638
Autor:
P K Neethu, S V Ullas Chandran
Publikováno v:
Discrete Applied Mathematics. 319:480-486
A set of vertices S of a graph G is a (geodesically) convex set, if S contains all the vertices belonging to any shortest path connecting two vertices of S . The cardinality of a maximum proper convex set of G is called the convexity number, con ( G
Publikováno v:
Discrete Applied Mathematics. 307:50-61
Given a set X ⊆ V ( G ) , let [ X ] G denote the set of all vertices of G lying on some shortest path between two vertices of X . If [ X ] G = X , then X is a convex set of G . The convex hull of X , denoted by 〈 X 〉 G , is the smallest convex
Autor:
Thomas, Elias John1 eliasjohnkalarickal@gmail.com, S. V., Ullas Chandran2 svuc.math@gmail.com
Publikováno v:
Proyecciones - Journal of Mathematics. abr2021, Vol. 40 Issue 2, p385-398. 14p.
Autor:
Elias John Thomas, S V Ullas Chandran
Publikováno v:
Proyecciones (Antofagasta). 40:385-398
An independent set S of vertices in a graph G is an independent position set if no three vertices of S lie on a common geodesic. An independent position set of maximum size is an ip-set of G. The cardinality of an ip-set is the independent position n
Publikováno v:
Fundamenta Informaticae. 178:267-281
The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is the graph
Autor:
Elias John Thomas, S V Ullas Chandran
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 i
Autor:
S V Ullas Chandran, Ferdoos Hossein Nezhad, Prasanth G. Narasimha-Shenoi, Mitre Costa Dourado, Manoj Changat, Bijo S. Anand
Publikováno v:
Theoretical Computer Science. 804:46-57
A set of vertices S of a graph G is geodesically convex if for every pair of vertices of S, all vertices of all shortest paths joining them also lie in S. The geodetic convex hull of S, denoted by 〈 S 〉 , is the minimum geodesically convex set of