Abstract
The Mycielski’s construction is a well-known construction on graphs which transforms a [Formula: see text]-chromatic triangle-free graph [Formula: see text] into a [Formula: see text]-chromatic triangle-free graph [Formula: see text] which is called the Mycielski graph of [Formula: see text]. In this paper, we compute the Harary index, additively weighted Harary index, and multiplicatively weighted Harary index of the Mycielski graph of any simple connected graph with girth greater than [Formula: see text].
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
