Reading: The minimum normalized cut value of tadpole graphs

Download

A- A+
Alt. Display

Articles

The minimum normalized cut value of tadpole graphs

Authors:

A. P. D. S. Senewirathna,

Ke/Gali/Kadigamuwa Bambaragama K.V., Pitagaldeniya, LK
X close

K. K. K. R. Perera

University of Kelaniya, LK
About K. K. K. R.
Department of Mathematics
X close

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.

DOI: https://doi.org/10.4038/jsc.v13i2.46
How to Cite: Senewirathna, A.P.D.S. and Perera, K.K.K.R., 2022. The minimum normalized cut value of tadpole graphs. Journal of Science, 13(2), pp.29–39. DOI: http://doi.org/10.4038/jsc.v13i2.46
5
Views
14
Downloads
Published on 31 Dec 2022.
Peer Reviewed

Downloads

  • PDF (EN)

    comments powered by Disqus