We present a method for automatically segmenting the blood vessels in optic nerve head (ONH) centered spectral-domain optical coherence tomography (SD-OCT) volumes, with a focus on the ability to segment the vessels in the region near the neural canal opening (NCO). The algorithm first pre-segments the NCO using a graph-theoretic approach. Oriented Gabor wavelets rotated around the center of th...

Cayley's theorem, in principle, can be used in determining the isomers of alkanes lot, which was originally limited to the calculation of the number of isomers of manual calculation, the method of "drawing and counting." Graph structure of the alkane is a tree (the tree). By proving that the alkane is a tree graph of a satisfying E (G) = V (G) with a value of V (G) = 3n + 2 and E (G) = 3n +1, -...

introduction: the most important change in medical education is a shift from didactic teacher-centered and subject-based teaching to the use of interactive, problem-based, student-centered learning. student-centered approach is a teaching approach t that encompasses replacing lectures with active learning, integrating self-paced learning programs and cooperative group situations, ultimately hol...

The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

Inspired by the recent success of self-supervised methods applied on images, learning graph structured data has seen rapid growth especially centered augmentation-based contrastive methods. However, we argue that without carefully designed augmentation techniques, augmentations graphs may behave arbitrarily in underlying semantics can drastically change. As a consequence, performance existing i...

In this paper, we present a practical algorithm to extract a curve skeleton of a 3D shape. The core of our algorithm comprises coupled processes of graph contraction and surface clustering. Given a 3D shape represented by a triangular mesh, we first construct an initial skeleton graph by directly copying the connectivity and geometry information from the input mesh. Graph contraction and surfac...