In this paper, we characterize the convex sets in the join of two graphs in a more general setting and determine its convexity number. We also show that a result in [1] concerning the geodetic number of the join of graphs does not always hold. In particular, we show that the geodetic number of the join of any two connected non-complete graphs is either 2, 3 or 4. Further, we characterize those joins which yield geodetic number equal to 2 and those with geodetic number equal to 3. Finally, we define and use the concept of 2-path closure absorbing set in a graph to characterize the hull sets in G + Km. We improve and correct a result in [5] by obtaining a more elegant expression for the hull number of the join G + Km̈, where G is a connected ...
AbstractGiven a convexity space X whose structure is induced by an interval operator I, we define a ...
AbstractWe prove three results conjectured or stated by Chartrand and Zhang [European J. Combin. 21 ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
In this paper, we characterize the convex sets in the join of two graphs in a more general setting a...
In the geodetic convexity, a set of vertices S of a graph G is convex if all vertices belonging to a...
A set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shorte...
AbstractA set S of vertices of a connected graph G is convex, if for any pair of vertices u,v∈S, eve...
AbstractA set of points S of a graph is convex if any geodesic joining two points of S lies entirely...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractFor every pair of vertices u,v in a graph, a u–v geodesic is a shortest path from u to v. Fo...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
AbstractA set S of vertices of a connected graph G is convex, if for any pair of vertices u,v∈S, eve...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractFor a connected graph G, the convex hull of a subset C of V(G) is defined as the smallest co...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractGiven a convexity space X whose structure is induced by an interval operator I, we define a ...
AbstractWe prove three results conjectured or stated by Chartrand and Zhang [European J. Combin. 21 ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
In this paper, we characterize the convex sets in the join of two graphs in a more general setting a...
In the geodetic convexity, a set of vertices S of a graph G is convex if all vertices belonging to a...
A set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shorte...
AbstractA set S of vertices of a connected graph G is convex, if for any pair of vertices u,v∈S, eve...
AbstractA set of points S of a graph is convex if any geodesic joining two points of S lies entirely...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractFor every pair of vertices u,v in a graph, a u–v geodesic is a shortest path from u to v. Fo...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
AbstractA set S of vertices of a connected graph G is convex, if for any pair of vertices u,v∈S, eve...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractFor a connected graph G, the convex hull of a subset C of V(G) is defined as the smallest co...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractGiven a convexity space X whose structure is induced by an interval operator I, we define a ...
AbstractWe prove three results conjectured or stated by Chartrand and Zhang [European J. Combin. 21 ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...