For two vertices u and v of a connected graph G, the set I[u, v] consists of all vertices lying on some u-v geodesic in G. Let S be a subset of the vertex set V(G), and denote by I[S] the union of all sets I[u, v] with u, v ∈ S. The set S is called convex if I[S] = S. The convex hull [S] of S is defined as the smallest convex set in G containing S. The hull number h(G) of a graph G is the cardinality of a smallest subset S ⊆ V(G) such that [S] = V(G). In this paper, we investigate the hull numbers of bicyclic and tricyclic graphs and provide a classification of these values.
Yaahmadi,Z and Mirzaei,K . (2026). Hull Numbers of Bicyclic and Tricyclic Graphs. (e737470). Mathematics and Computational Sciences, (), e737470 doi: 10.30511/mcs.2026.2090722.1814
MLA
Yaahmadi,Z , and Mirzaei,K . "Hull Numbers of Bicyclic and Tricyclic Graphs" .e737470 , Mathematics and Computational Sciences, , , 2026, e737470. doi: 10.30511/mcs.2026.2090722.1814
HARVARD
Yaahmadi Z, Mirzaei K. (2026). 'Hull Numbers of Bicyclic and Tricyclic Graphs', Mathematics and Computational Sciences, (), e737470. doi: 10.30511/mcs.2026.2090722.1814
CHICAGO
Z Yaahmadi and K Mirzaei, "Hull Numbers of Bicyclic and Tricyclic Graphs," Mathematics and Computational Sciences, (2026): e737470, doi: 10.30511/mcs.2026.2090722.1814
VANCOUVER
Yaahmadi Z, Mirzaei K. Hull Numbers of Bicyclic and Tricyclic Graphs. MCS. 2026;():e737470. doi: 10.30511/mcs.2026.2090722.1814
