Abstract
<p class="Default">The Tadpole graph <em>T<sub>n,k </sub></em>is a Lollipop type graph obtained by joining a one vertex of cycle graph <em>C<sub>n</sub> </em>to the end vertex of a path graph <em>P<sub>k</sub></em> 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
