3 citations · 3 across the 11 of their papers we have counts for
12 papers
Computing the Helly Number, Radon Number and Rank in Cycle Convexity
Revathy S. Nair, Bijo S. Anand, Ullas Chandran S. V. +2
In this paper, we investigate three fundamental convexity parameters of graphs under cycle convexity, namely the Helly number, Radon number, and rank. We first study the computatio…
Computing the Exchange Number in Graphs with respect to Cycle Convexity
Revathy S. Nair, Bijo S. Anand, Julliano R. Nascimento
Given a graph , a subset is \textit{cycle convex}, if for any vertex , the induced subgraph, cannot form a cycle con…
Carathéodory Number in Cycle Convexity
Revathy S. Nair, Bijo S. Anand, Ullas Chandran S. V. +1
Let be a graph and . In the cycle convexity, we say that is \textit{cycle convex} if for any , the induced subgraph of …
Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
Bijo S. Anand, Manoj Changat, Prasanth G. Narasimha-Shenoi +3
Suppose is a strongly connected digraph and . Among the many metrics in graphs, the sum metric warrants further exploration. The sum distance $sd(u, v)…
Domination in Graph Theory: A Bibliometric Analysis of Research Trends, Collaboration and Citation Networks
Jonecis A. Dayap, Leomarich F. Casinillo, Bijo S. Anand +2
This study conducts a comprehensive bibliometric analysis of research on domination in graph theory from 1961 to 2024, based on Scopus-indexed publications retrieved using the quer…
Partitions and covers in convexity
Bijo S. Anand, Manoj Changat, Mitre C. Dourado +2
Given a graph and a set , we say that is -convex if the neighborhood of every vertex not in is an independent set. A collection ${\cal V} = (V_1, V…
Revisiting the outer-weakly convex domination number in graph products
Bijo S. Anand, Ullas Chandran S. V., Jonecis A. Dayap +2
Let be a simple undirected connected graph. A set is weakly convex in if for every two vertices in , there exists a geodesic whos…
Carathodory Number and Exchange Number in -convexity
Bijo S. Anand, Arun Anil, Manoj Changat +2
Given a graph , a set is -convex if there is no vertex forming a triangle with two vertices of . The -convex hull of is the minimum -conve…
Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
Bijo S. Anand, Ullas Chandran S. V., Julliano R. Nascimento +1
Let be a graph and . In the cycle convexity, we say that is \textit{cycle convex} if for any , the induced subgraph of …
Helly Number, Radon Number and Rank in -Convexity on Graphs
Bijo S Anand, Arun Anil, Manoj Changat +2
This article discusses -convexity on simple connected graphs. We establish general bounds for the Helly number, Radon number, and rank with respect to -convexity on graphs. A…
Boundary-type Sets of Strong Product of Directed Graphs
Prasanth G. Narasimha-Shenoi, Bijo S Anand, Mary Shalet T J
Let be a strongly connected digraph and let . The maximum distance is defined as\\ =max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,…
Characterization of general position sets and its applications to cographs and bipartite graphs
Bijo S. Anand, Ullas Chandran S. V., Manoj Changat +2
A vertex subset of a graph is a general position set of if no vertex of lies on a geodesic between two other vertices of . The cardinality of a largest general p…