Abstract
A connected graph with p vertices and q edges satisfying q=p+1 is referred to as a bicyclic graph. This paper is concerned with an optimal study of the BID (bond incident degree) indices of fixed-size bicyclic graphs with a given matching number. Here, a BID index of a graph G is the number BIDf(G)=∑vw∈E(G)f(dG(v),dG(w)), where E(G) represents G’s edge set, dG(v) denotes vertex v’s degree, and f is a real-valued symmetric function defined on the Cartesian square of the set of all different members of G’s degree sequence. Our results cover several existing indices, including the Sombor index and symmetric division deg index.
Published Version
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.
