The minimum normalized cut value of tadpole graphs
Open Access
|Dec 2022Abstract
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 | Journal eISSN: 2602-9030
Language: English
Page range: 29 - 39
Published on: Dec 31, 2022
Published by: Faculty of Science, Eastern University, Sri Lanka
In partnership with: Paradigm Publishing Services
Keywords:
© 2022 A. P. D. S. Senewirathna, K. K. K. R. Perera, published by Faculty of Science, Eastern University, Sri Lanka
This work is licensed under the Creative Commons License.