Abstract
The Tadpole graph Tn,k is a Lollipop type graph obtained by joining a one vertex of cycle graph Cn to the end vertex of a path graph Pk The normalized cut is a measure of disassociation between two groups which computes the cut cost as a fraction of the total edge connections to all the vertices in the graph. This research focuses on deriving a formula to find the minimum normalized cut value of Tadpole graphs.
Published on
31 Dec 2022.
Peer Reviewed
