Next Article in Journal
Numerical Simulation for the Wave of the Variable Coefficient Nonlinear Schrödinger Equation Based on the Lattice Boltzmann Method
Previous Article in Journal
A Proof Calculus for Automated Deduction in Propositional Product Logic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number

1
Department of Mathematics, College of Science, University of Ha’il, Ha’il 81451, Saudi Arabia
2
Department of Mathematics, Faculty of Sciences, University of Tabuk, Tabuk P.O. Box 741, Saudi Arabia
3
Department of Sciences and Humanities, National University of Computer and Emerging Sciences, B-Block, Faisal Town, Lahore 54770, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(23), 3806; https://doi.org/10.3390/math12233806
Submission received: 7 October 2024 / Revised: 20 November 2024 / Accepted: 27 November 2024 / Published: 1 December 2024

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 BID f ( G ) = v w E ( G ) f ( d G ( v ) , d G ( w ) ) , where E ( G ) represents G’s edge set, d G ( 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.

1. Introduction

Throughout this study, the considered graphs are connected. The books [1,2,3] and [4,5,6] can be consulted for the fundamental concepts of graph theory and chemical graph theory, respectively.
A graph with size m is referred to as an m-size graph. Similarly, an n-order graph is the one having order n. The notations E ( G ) and V ( G ) are used for the sets of edges and vertices of a graph G, respectively. For a vertex w V ( G ) , its degree is represented by d G ( w ) .
A graph invariant GI is a property associated with graphs in such a way that the equation GI ( G ) = GI ( G ) holds for every two isomorphic graphs G and G [3]. The graph invariants that take only real numbers are often referred to as topological indices or molecular descriptors by chemical graph theorists [4,5,6]. Chemical graph theory is a subfield of mathematical chemistry that models and investigates the structures of chemical compounds using graph theory. Atoms (of chemical compounds) are commonly represented in this discipline as vertices in a graph, and bonds (of chemical compounds) are represented as edges between the vertices. Important chemical characteristics can be derived by applying graph-theoretical principles to structures of chemical compounds; for example, see some most recent papers in this research direction including [7,8].
In the current study, we are concerned with bond incident degree indices (BID indices for short), which form a special collection of topological indices. For a graph G, the general form of a bond incident degree index (for example, see [9,10,11]) is as follows:
BID f ( G ) = w v E ( G ) f ( d G ( w ) , d G ( v ) ) ,
where f : D ( G ) × D ( G ) ( , ) is a symmetric function, and D ( G ) represents the set of all different elements of the degree sequence of G. We note here that such indices are also known as graphical edge-weight-function indices [12]. Also, we remark that the aforementioned class of indices is a proper subclass of the class of all degree-based topological indices; for example, see [13].
A connected m-size graph of order m 1 is referred to as a bicyclic graph. In other words, a connected graph containing at least two cycles is said to be a bicyclic graph if the removal of its exactly two edges yields a tree (a connected graph without any cycle). Here, we remark that a bicyclic graph may have more than two cycles. The present paper is concerned with an optimal study of the BID indices of fixed-size bicyclic graphs with a given matching number. Our results can be divided into the following two categories: (i) results about perfect matching, and (ii) results about a given matching number. Our results from each of the aforementioned two categories cover the SO (Sombor) index [14,15,16], the reduced Sombor index [16], the Euler Sombor (ES) index [17], the arithmetic-geometric index (for example, see [18]), the symmetric division deg (SDD) index [19,20], and the modified symmetric division deg (MSDD) index [21]. In other words, our results generalize a few existing results and provide particular new cases for several existing indices. As there are a lot of particular BID indices and, in many cases, the extremal results with respect to them, including their proofs, are considerably similar to one another, it is natural to think of adopting a unified technique to obtain those results and hence generalize them, which is the primary motivation of the current study.

2. Preliminaries

In the current section, we give the definitions and notions that are used in the subsequent section.
A vertex of degree one in a graph is known as a pendent vertex. An edge that is incident to a pendent vertex is called a pendent edge. For a vertex u of a graph G, we define N G ( u ) : = { x : x u E ( G ) } . Every vertex x N G ( u ) is called the neighbor of u. A subset U of the edge set of a graph is said to be a matching if U contains no two adjacent edges. A matching consisting of α edges is known as an α -matching. A matching U in a graph G is said to be maximum if G contains no matching of size larger than | U | . The number of edges in a maximum matching of a graph G is referred to as the matching number of G. A vertex incident to an edge of a matching U is referred to as U-saturated; in particular, if every vertex of the graph is U-saturated, then U is referred to as a perfect matching. A vertex that is not U-saturated is referred to as a U-unsaturated vertex.
For two vertices v and w of a graph G, we use G { v , w } to denote the graph formed by dropping v , w , and all the edges incident with them. Similarly, G { w } is defined. For simplicity, we write G w instead of writing G { w } . Also, if p q is an edge of G, then the graph formed by dropping p q is represented as G p q .
A connected m-size graph of order m is referred to as a unicyclic graph. Let S n + denote the n-size unicyclic graph constructed by adding precisely one edge to the n-order start graph, where n 4 . Let U n , ν denote the graph generated by inserting one vertex of degree 2 on each of the ν 2 pendent edges of the graph S n ν + 2 + , where 4 2 ν n . Figure 1 shows the graph U n , ν .
Let S n + denote the ( n + 1 ) -size bicyclic graph constructed by inserting two non-adjacent edges to the n-order star graph S n . Let B n , ν denote the graph generated by inserting one vertex of degree 2 on each of the ν 3 pendent edges of the graph S n ν + 3 + , where 6 2 ν n . Figure 2 shows the graph B n , ν . We end this preliminary section by noting that both the graphs U 2 ν , ν and B 2 ν , ν have perfect matching.

3. Main Results

We start this section by giving a result for fixed-size bicyclic graphs having a matching number 2. Let S n + + denote the bicyclic graph formed by inserting two adjacent edges to the n-order star graph S n .
Theorem 1.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . If S n + + uniquely possesses the maximum value of BID f among all ( n + 1 ) -size bicyclic graphs, then
BID f ( G ) ( n 4 ) f ( n 1 , 1 ) + 2 f ( n 1 , 2 ) + f ( n 1 , 3 ) + 2 f ( 2 , 3 ) .
for every ( n + 1 ) -size bicyclic graph G having a matching number 2. The equality in (1) holds iff G S n + + .
Proof. 
Since S n + + uniquely possesses the maximum value of BID f among all ( n + 1 ) -size bicyclic graphs and BID f ( S n + + ) = ( n 4 ) f ( n 1 , 1 ) + 2 f ( n 1 , 2 ) + f ( n 1 , 3 ) + 2 f ( 2 , 3 ) , the required conclusion follows from the fact that the matching number of S n + + is 2. □
Next, we have a minimal version of Theorem 1.
Theorem 2.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . If S n + + uniquely possesses the minimum value of BID f among all ( n + 1 ) -size bicyclic graphs, then
BID f ( G ) ( n 4 ) f ( n 1 , 1 ) + 2 f ( n 1 , 2 ) + f ( n 1 , 3 ) + 2 f ( 2 , 3 )
for every ( n + 1 ) -size bicyclic graph G having a matching number 2. The equality in (2) holds iff G S n + + .
Proof. 
Similar to the proof of Theorem 1. □
In order to prove our next two results, we need the following two known results about unicyclic graphs:
Lemma 1 
([22]). Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . If the following hold:
(i
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) < 0 for η 1 , η 2 { 2 , 3 } ;
(ii
η 1 [ f ( 1 , 3 ) + f ( 3 , 3 ) ] < η 1 f ( η 1 + 1 , 2 ) + ( η 1 2 ) f ( 1 , 2 ) + f ( η 1 + 1 , 1 ) + f ( 2 , 2 ) for η 1 3 ;
(iii
the function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly decreasing in η 1 for η 2 2 and η 1 1 ;
(iv
the function ℏ, defined as
( η 1 ) = f ( η 1 , 2 ) + f ( η 1 , 1 ) f ( η 1 1 , 1 ) + ( η 1 2 ) f ( η 1 , 2 ) f ( η 1 1 , 2 ) ,
is strictly increasing for η 1 2 ;
then, for every 2 ν -size unicyclic graph G having a matching number ν ( 2 ) ,
BID f ( G ) ν f ( ν + 1 , 2 ) + ( ν 2 ) f ( 1 , 2 ) + f ( ν + 1 , 1 ) + f ( 2 , 2 ) ,
with equality iff G U 2 ν , ν (see Figure 1).
Lemma 2
([22]). Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . If the following hold:
(i
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) > 0 for η 1 , η 2 { 2 , 3 } ;
(ii
η 1 [ f ( 1 , 3 ) + f ( 3 , 3 ) ] > η 1 f ( η 1 + 1 , 2 ) + ( η 1 2 ) f ( 1 , 2 ) + f ( η 1 + 1 , 1 ) + f ( 2 , 2 ) for η 1 3 ;
(iii
the function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly increasing in η 1 for η 2 2 and η 1 1 ;
(iv
the function ℏ, defined as
( η 1 ) = f ( η 1 , 2 ) + f ( η 1 , 1 ) f ( η 1 1 , 1 ) + ( η 1 2 ) f ( η 1 , 2 ) f ( η 1 1 , 2 ) ,
is strictly decreasing for η 1 2 ;
then, for every 2 ν -size unicyclic graph G having a matching number ν ( 2 ) ,
BID f ( G ) ν f ( ν + 1 , 2 ) + ( ν 2 ) f ( 1 , 2 ) + f ( ν + 1 , 1 ) + f ( 2 , 2 ) ,
with equality iff G U 2 ν , ν (see Figure 1).
In order to prove the next result, we also define five particular classes of bicyclic graphs. Let B q ( 1 ) , B q ( 2 ) , B q ( 3 ) , B q ( 4 ) , and B q ( 5 ) denote the classes of all those q-order graphs that are formed by the following, respectively:
  • Inserting an edge between two non-adjacent vertices of the q-order cycle graph C q , provided that q 4 ;
  • Inserting a path of length at least 2 between two non-adjacent vertices of a cycle graph of order at least 4;
  • Connecting two disjoint cycles via a path of length at least 2;
  • Identifying one vertex of two disjoint cycles;
  • Inserting an edge between two vertices of two disjoint cycles.
For every i { 1 , 2 , , 5 } , the general form B q ( i ) of the graphs of B q ( i ) is depicted in Figure 3.
Lemma 3.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] < η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) < 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly decreasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) < 0 ;
(v).
Θ 1 ( η ) < Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ 2 ( η ) < Θ ( η ) for η 5 , where Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) and Θ ( η ) is defined in condition (v);
(vii).
Θ 3 ( η ) < Θ ( η ) for η 5 , where Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) and Θ ( η ) is defined in condition (v);
(viii).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly increasing;
(ix).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) < 0 for η 1 4 ;
(x).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) < 0 for η 1 , η 2 { 2 , 3 , 4 } .
If G is a ( 2 ν + 1 ) -size bicyclic graph having a matching number ν ( 3 ) such that it does not contain any pendent vertex adjacent to a vertex of degree 2, then BID f ( G ) Θ ( ν ) , with equality iff G B 6 , 3 (see Figure 2), where Θ ( ν ) is defined in condition (v).
Proof. 
We observe that no two pendent edges of G can be adjacent. Let M be a ν -matching in G. Since M is a perfect matching and G does not contain any pendent vertex adjacent to a vertex of degree 2, G must be a graph formed by attaching at most one pendent vertex to every vertex of a graph B q i = 1 5 B q ( i ) such that ν q 2 ν , where the general form B q ( i ) of the q-order graphs of B q ( i ) for every i { 1 , 2 , , 5 } is depicted in Figure 3. Therefore, the maximum degree of G is at most 5.
Case 1.
The graph G contains no vertex of degree 2.
In the present case, we observe that either q = ν or q = ν + 1 . If q = ν , then G is a graph formed by attaching exactly one pendent vertex to every vertex of a graph B q i = 1 5 B q ( i ) . However, if q = ν + 1 , then G is a graph formed by attaching exactly one pendent vertex to every vertex of degree 2 of a graph B q B q ( 1 ) B q ( 5 ) .
Subcase 1.1.
ν = 3 .
In the present subcase, we note that q = 4 , and thus G is the 6-order graph formed by attaching exactly one pendent vertex to every vertex of degree 2 of the unique graph in B 4 ( 1 ) . We note that
Θ ( 3 ) 5 f ( 3 , 3 ) 2 f ( 1 , 3 ) > f ( 2 , 2 ) f ( 3 , 3 ) + 2 [ f ( 1 , 3 ) f ( 1 , 2 ) ]
> f ( 2 , 3 ) f ( 3 , 3 ) + f ( 1 , 3 ) f ( 1 , 2 )
> f ( 2 , 2 ) f ( 3 , 2 ) + f ( 1 , 3 ) f ( 1 , 2 )
> 0 ,
where inequality (3) is obtained by taking η 2 = 4 in condition (i) of the lemma, inequalities (4) and (6) follow from condition (iii) (particularly, from g ( 1 , 3 ) > g ( 2 , 3 ) ), and inequality (5) also follows from condition (iii) (particularly, from g ( 2 , 3 ) > g ( 3 , 3 ) ). Therefore, we have
BID f ( G ) = 2 f ( 3 , 1 ) + 5 f ( 3 , 3 ) < Θ ( 3 ) ,
as desired.
Subcase 1.2.
ν = 4 .
In the present subcase, q { 4 , 5 } , and thus, by keeping in mind the fact that G does not contain any vertex of degree 2, we observe that G is the 8-order graph formed by attaching exactly one pendent vertex to either every vertex of the unique graph in B 4 ( 1 ) , or every vertex of degree 2 of the unique graph in B 5 ( 1 ) . Hence, we have
BID f ( G ) = 2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) if q = 4 , 3 f ( 3 , 1 ) + 6 f ( 3 , 3 ) < Θ ( ν ) if q = 5 ,
If q = 4 , then the required inequality, that is BID f ( G ) < Θ ( 4 ) , follows from condition (iv). If q = 5 , then we note that
Θ ( 5 ) 6 f ( 3 , 3 ) 3 f ( 1 , 3 ) > f ( 2 , 2 ) f ( 3 , 3 ) + 2 [ f ( 1 , 3 ) f ( 1 , 2 ) ] ,
where (7) is obtained by taking η 2 = 5 in condition (i). We note that the right-hand sides of (3) and (7) are the same. Therefore, based on (3)–(7), we have
BID f ( G ) = 3 f ( 3 , 1 ) + 6 f ( 3 , 3 ) < Θ ( 5 ) .
Subcase 1.3.
ν 5 .
In this subcase, we have
BID f ( G ) = Θ 1 ( ν ) < Θ ( ν ) if B ν B ν ( 1 ) B ν ( 5 ) , ( ν 1 ) f ( 3 , 1 ) + ( ν + 2 ) f ( 3 , 3 ) < Θ ( ν ) if B ν + 1 B ν + 1 ( 1 ) B ν + 1 ( 5 ) , Θ 2 ( ν ) < Θ ( ν ) if B ν B ν ( 2 ) B ν ( 3 ) , Θ 3 ( ν ) < Θ ( ν ) if B ν B ν ( 4 ) ,
where the first, third, and fourth inequalities follow from conditions (v), (vi), and (vii), respectively. In the rest of the considered subcase, we prove the inequality corresponding to the situation, when B ν + 1 B ν + 1 ( 1 ) B ν + 1 ( 5 ) . The choice η 2 = ν + 1 in condition (i) yields
Θ ( ν ) ( ν + 2 ) f ( 3 , 3 ) ( ν 1 ) f ( 1 , 3 ) > f ( 2 , 2 ) f ( 3 , 3 ) + 2 [ f ( 1 , 3 ) f ( 1 , 2 ) ] .
We note that the right-hand sides of (3) and (8) are the same, which is positive based on (3)–(6).
Case 2.
The graph G contains at least one vertex of degree 2.
We choose a vertex x V ( G ) of degree 2 in the following way: if at least one cycle of G contains at least one vertex of degree 2, then we assume that x lies on a cycle of G; otherwise, we suppose that x is any vertex of degree 2. Take N G ( x ) = { y , z } . Then min { d G ( y ) , d G ( z ) } 2 because G contains no pendent vertex adjacent to a vertex of degree 2. Since exactly one of the edges incident to x belongs to M , without loss of generality, we suppose that x y M .
Subcase 2.1.
No cycle of G contains any vertex of degree 2.
Since G does not contain any pendent vertex adjacent to a vertex of degree 2, its induced subgraph without pendent vertices must belong to B q ( 3 ) , and thus, there is a unique path between the vertices y , z V ( G ) . Let G denote the graph formed by dropping the edge x z and adding y z . We note that the matching number of G is also ν . Only the degrees of the vertices x and y are changed in G after applying the aforementioned transformation on G, and every other vertex has the same degree in both G and G . We note that the maximum degree of G is at most 4 in the current subcase. Therefore, by conditions (iii) and (x), we have
BID f ( G ) BID f ( G ) = y N G ( y ) { x } [ f ( d G ( y ) , d G ( y ) ) f ( d G ( y ) + 1 , d G ( y ) ) ] + f ( 2 , d G ( z ) ) f ( d G ( y ) + 1 , d G ( z ) ) + f ( 2 , d G ( y ) ) f ( 1 , d G ( y ) + 1 ) ( d G ( y ) 1 ) [ f ( d G ( y ) , 4 ) f ( d G ( y ) + 1 , 4 ) ] + f ( 2 , d G ( z ) ) f ( d G ( y ) + 1 , d G ( z ) ) + f ( 2 , d G ( y ) ) f ( 1 , d G ( y ) + 1 ) < 0 .
This means that the above transformation reduces the number of vertices of degree 2 present in G by exactly 1 without changing its matching number. Consequently, we conclude that after applying this transformation a finite number of times on G, we obtain a graph G * containing no vertex of degree 2 such that BID f ( G ) < BID f ( G * ) . Now, by Case 1, we have BID f ( G ) < BID f ( G * ) < Θ ( ν ) , as desired.
Subcase 2.2.
At least one cycle of G contains at least one vertex of degree 2.
In this subcase, the vertex x lies on a cycle of G. Thus, the graph G x z is a 2 ν -size unicyclic graph having a matching number ν . Since z has at most one pendent neighbor, by condition (iii) of the lemma, we have
BID f ( G ) BID f ( G x z ) = z N G ( z ) { x } [ f ( d G ( z ) , d G ( z ) ) f ( d G ( z ) 1 , d G ( z ) ) ] + f ( 2 , d G ( y ) ) f ( 1 , d G ( y ) ) + f ( 2 , d G ( z ) ) [ ( d G ( z ) 2 ) { f ( d G ( z ) , 2 ) f ( d G ( z ) 1 , 2 ) } + f ( d G ( z ) , 1 ) f ( d G ( z ) 1 , 1 ) + f ( 2 , d G ( z ) ) ] + f ( 2 , 2 ) f ( 1 , 2 ) .
We recall the definition of the function given in condition (viii) of the lemma and note that the expression given within the square brackets on the right-hand side of (9) is equal to ( d G ( z ) ) . Since 2 d G ( z ) 5 , we have ( d G ( z ) ) ( 5 ) , and hence (9) gives
BID f ( G ) BID f ( G x z ) 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) + f ( 2 , 2 ) f ( 1 , 2 ) ,
which yields the following inequality (because of Lemma 1):
BID f ( G ) ν f ( ν + 1 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + f ( ν + 1 , 1 ) + 2 f ( 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) ,
where the equality in (10) holds iff z has d G ( z ) 1 neighbors of degree 2 and one pendent neighbor, d G ( y ) = 2 , d G ( z ) = 5 , and G x z U 2 ν , ν . By keeping in mind condition (ix), for ν 3 , we have
ν f ( ν + 1 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + f ( ν + 1 , 1 ) + 2 f ( 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) Θ ( ν ) ,
with equality iff ν = 3 . Now, the required conclusion follows from (10) and (11). □
Proof of the following result uses Lemma 2, and is totally similar to that of Lemma 3, and hence we omit it.
Lemma 4.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] > η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) > 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly increasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) > 0 ;
(v).
min { Θ 1 ( η ) , Θ 2 ( η ) , Θ 3 ( η ) } > Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) , Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ 1 ( η ) > Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vii).
Θ 2 ( η ) > Θ ( η ) for η 5 , where Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , and Θ ( η ) is defined in condition (v);
(viii).
Θ 3 ( η ) > Θ ( η ) for η 5 , where Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) , and Θ ( η ) is defined in condition (v);
(ix).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly decreasing;
(x).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) > 0 for η 1 4 ;
(xi).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) > 0 for η 1 , η 2 { 2 , 3 , 4 } .
If G is a ( 2 ν + 1 ) -size bicyclic graph having a matching number ν ( 3 ) such that it does not contain any pendent vertex adjacent to a vertex of degree 2, then BID f ( G ) Θ ( ν ) , with equality iff G B 6 , 3 (see Figure 2).
Theorem 3.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] < η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) < 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly decreasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) < 0 ;
(v).
max { Θ 1 ( η ) , Θ 2 ( η ) , Θ 3 ( η ) } < Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) , Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) , and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ ( 3 ) > max { f ( 1 , 2 ) + 3 f ( 2 , 3 ) + 3 f ( 3 , 3 ) , f ( 1 , 2 ) + 3 f ( 2 , 4 ) + 2 f ( 2 , 3 ) + f ( 3 , 4 ) } ;
(vii).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly increasing;
(viii).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) < 0 for η 1 4 ;
(ix).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) < 0 for η 1 , η 2 { 2 , 3 , 4 } .
If G is a ( 2 ν + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then BID f ( G ) Θ ( ν ) , with equality iff G B 2 ν , ν (see Figure 2).
Proof. 
We use induction on ν to prove the theorem. Assume first that ν = 3 . If G does not contain any pendent vertex adjacent to a vertex of degree 2, then the desired conclusion is valid based on Lemma 3 (for ν = 3 ). However, if G contains a pendent vertex adjacent to a vertex of degree 2, then G can be formed by attaching a path of length 2 to a vertex of the unique graph of B 4 ( 1 ) (see Figure 3). Hence, either
BID f ( G ) = f ( 1 , 2 ) + 3 f ( 2 , 3 ) + 3 f ( 3 , 3 ) or
BID f ( G ) = f ( 1 , 2 ) + 3 f ( 2 , 4 ) + 2 f ( 2 , 3 ) + f ( 3 , 4 ) .
In either case, based on condition (vi), we have BID f ( G ) < Θ ( 3 ) , which completes the base step of the induction. Let us now assume that ν > 3 and that the theorem’s conclusion holds for all ( 2 ν 1 ) -size bicyclic graphs having ν 1 matching numbers. We next consider a ( 2 ν + 1 ) -size bicyclic graph G with a matching number ν ( > 3 ) . If G has no pendent vertex adjacent to a vertex of degree 2, then the desired conclusion holds because of Lemma 3. In the rest of the proof, we assume that G has at least one pendent vertex adjacent to a vertex of degree 2. Take x , y V ( G ) such that x y E ( G ) , d G ( x ) = 1 and d G ( y ) = 2 . Let N G ( y ) : = { x , z } . Let M be a ν -matching of G. Since G consists of 2 ν + 1 edges and because z is not incident with at least ν 1 edges belonging to M , we have d G ( z ) 2 ν + 1 ( ν 1 ) = ν + 2 . Clearly, x y M . Since G : = G { x , y } has 2 ν 1 edges and because its matching number is ν 1 , the induction hypothesis implies the following:
BID f ( G ) Θ ( ν 1 ) ,
where the equality is satisfied iff G B 2 ( ν 1 ) , ν 1 . Since z has at most one pendent neighbor, by using conditions (iii) and (vii) of the theorem, we have
BID f ( G ) BID f ( G ) = f ( 1 , 2 ) + f ( d G ( z ) , 2 ) + z N G ( z ) { y } f ( d G ( z ) , d G ( z ) ) f ( d G ( z ) 1 , d G ( z ) ) f ( 1 , 2 ) + f ( d G ( z ) , 2 ) + ( d G ( z ) 2 ) f ( d G ( z ) , 2 ) f ( d G ( z ) 1 , 2 ) + f ( d G ( z ) , 1 ) f ( d G ( z ) 1 , 1 ) f ( 1 , 2 ) + f ( ν + 2 , 2 ) + ν f ( ν + 2 , 2 ) f ( ν + 1 , 2 ) + f ( ν + 2 , 1 ) f ( ν + 1 , 1 ) .
From (12) and (13), we obtain BID f ( G ) Θ ( ν ) with equality iff G B 2 ν , ν . □
Proof of the following theorem uses Lemma 4 and is completely analogous to that of Theorem 3, and thus we omit it.
Theorem 4. 
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] > η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) > 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly increasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) > 0 ;
(v).
min { Θ 1 ( η ) , Θ 2 ( η ) , Θ 3 ( η ) } > Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) , Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) , and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ ( 3 ) < min { f ( 1 , 2 ) + 3 f ( 2 , 3 ) + 3 f ( 3 , 3 ) , f ( 1 , 2 ) + 3 f ( 2 , 4 ) + 2 f ( 2 , 3 ) + f ( 3 , 4 ) } ;
(vii).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly decreasing;
(viii).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) > 0 for η 1 4 ;
(ix).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) > 0 for η 1 , η 2 { 2 , 3 , 4 } .
If G is a ( 2 ν + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then BID f ( G ) Θ ( ν ) , with equality iff G B 2 ν , ν (see Figure 2).
We notice that BID f coincides with the SO (Sombor) index [14,16], or the RSO (reduced Sombor) index [16], or the Euler Sombor (ES) index [17], or the arithmetic-geometric (AG) index (for example, see [18]), or the symmetric division deg (SDD) index [19,20], or the modified symmetric division deg (MSDD) index [21], when f ( ξ 1 , ξ 2 ) = ξ 1 2 + ξ 2 2 , or f ( ξ 1 , ξ 2 ) = ( ξ 1 1 ) 2 + ( ξ 2 1 ) 2 , or f ( ξ 1 , ξ 2 ) = ξ 1 2 + ξ 2 2 + ξ 1 ξ 2 , or f ( ξ 1 , ξ 2 ) = ( 2 ξ 1 ξ 2 ) 1 ( ξ 1 + ξ 2 ) , or f ( ξ 1 , ξ 2 ) = ( ξ 1 ξ 2 ) 1 ( ξ 1 2 + ξ 2 2 ) , or f ( ξ 1 , ξ 2 ) = ( 2 ξ 1 ξ 2 ) 1 ( ξ 1 2 + ξ 2 2 ) , respectively. We verified all the conditions of Theorem 3 for all the aforementioned choices of f , and hence we have the next result (which follows from Theorem 3).
Corollary 1.
Let BID f be one of the following: SO index, RSO index, ES index, AG index, SDD index, or MSDD index. If G is any ( 2 ν + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then
BID f ( G ) f ( ν + 2 , 1 ) + ( ν + 1 ) f ( ν + 2 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ,
with equality iff G B 2 ν , ν (see Figure 2).
Before proceeding further, we recall the following known lemma that will be used in proving our next main result:
Lemma 5
([23]). If G is an ( n + 1 ) -size bicyclic graph possessing a matching number ν and at least one pendent vertex, provided that n > 2 ν 6 , then G contains a ν-matching M and a pendent vertex w such that w is M -unsaturated.
Theorem 5. 
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Also, assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] < η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) < 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly decreasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) < 0 ;
(v).
max { Θ 1 ( η ) , Θ 2 ( η ) , Θ 3 ( η ) } < Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) , Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) , and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ ( 3 ) > max { f ( 1 , 2 ) + 3 f ( 2 , 3 ) + 3 f ( 3 , 3 ) , f ( 1 , 2 ) + 3 f ( 2 , 4 ) + 2 f ( 2 , 3 ) + f ( 3 , 4 ) } ;
(vii).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly increasing;
(viii).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) < 0 for η 1 4 ;
(ix).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) < 0 for η 1 , η 2 { 2 , 3 , 4 } ,
(x).
max { ( 2 η 3 ) f ( 2 , 2 ) + 4 f ( 2 , 3 ) + f ( 3 , 3 ) ; 2 ( η 2 ) f ( 2 , 2 ) + 6 f ( 2 , 3 ) , 2 ( η 1 ) f ( 2 , 2 ) + 4 f ( 2 , 4 ) } < 2 f ( η + 3 , 1 ) + ( η + 1 ) f ( η + 3 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) for η 3 ;
(xi).
The function Ψ, defined as Ψ ( η 1 , η 2 ) = f ( η 2 1 , 1 ) + η 1 [ f ( η 2 , 1 ) f ( η 2 1 , 1 ) ] + ( η 2 η 1 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) , is strictly increasing in η 2 for η 2 η 1 + 1 2 .
If G is an ( n + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then
BID f ( G ) ( n 2 ν + 1 ) f ( n ν + 2 , 1 ) + ( ν + 1 ) f ( n ν + 2 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ,
with equality iff G B n , ν (see Figure 2).
Proof. 
We define
Φ ( n , ν ) : = ( n 2 ν + 1 ) f ( n ν + 2 , 1 ) + ( ν + 1 ) f ( n ν + 2 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) .
The result will be proved by using induction on n. Since all the conditions of Theorem 3 are listed in the statement of the current theorem, the desired conclusion is true for n = 2 ν because of Theorem 3. Let us now assume that n > 2 ν and that the result holds for all n-size bicyclic graphs having a matching number ν . We next consider an ( n + 1 ) -size bicyclic graph possessing a matching number ν such that n > 2 ν . We note that the minimum degree of G is either 1 or 2.
Case. 1.
The minimum degree of G is 2.
In the current case, it holds that n = 2 ν + 1 , and hence G B 2 ν + 1 ( i ) for some i { 1 , 2 , , 5 } (see Figure 3). Here, we have
BID f ( G ) = ( 2 ν 3 ) f ( 2 , 2 ) + 4 f ( 2 , 3 ) + f ( 3 , 3 ) if G B 2 ν + 1 ( 1 ) B 2 ν + 1 ( 5 ) , 2 ( ν 2 ) f ( 2 , 2 ) + 6 f ( 2 , 3 ) if G B 2 ν + 1 ( 2 ) B 2 ν + 1 ( 3 ) , 2 ( ν 1 ) f ( 2 , 2 ) + 4 f ( 2 , 4 ) if G B 2 ν + 1 ( 4 ) .
In any of the above three possibilities, by condition (x) of the theorem, we have
BID f ( G ) < Φ ( 2 ν + 1 , ν ) ,
as desired.
Case. 2.
The minimum degree of G is 1.
Based on Lemma 5, G contains a ν -matching M and a pendent vertex x such that x is M -unsaturated. Thus, the matching number of G is the same as the one that G x has. Hence, by the inductive hypothesis, we obtain
BID f ( G x ) Φ ( n 1 , ν )
with equality iff G x B n 1 , ν . Let y denote the unique neighbor of x. We observe that M must contain an edge incident to y as M is a maximum matching and y x M . Hence, because G has n + 1 edges, we have d G ( y ) n + 1 ( | M | 1 ) ; that is,
d G ( y ) n ν + 2 .
Take N G ( y ) : = { y 1 , y 2 , , y p , y p + 1 , , y r } , where the vertices y 1 ( = x ) , y 2 , , y p are pendent, and all the remaining vertices of N G ( y ) are non-pendent. Since the total number of M -unsaturated vertices of G is n 2 ν , and because at least p 1 pendent neighbors of y are M -unsaturated, we have p 1 n 2 ν . Based on condition (iii), we have
BID f ( G ) BID f ( G x ) = f ( d G ( y ) , 1 ) + ( p 1 ) [ f ( d G ( y ) , 1 ) f ( d G ( y ) 1 , 1 ) ] + i = p + 1 d G ( y ) f ( d G ( y ) , d G ( y i ) ) f ( d G ( y ) 1 , d G ( y i ) ) f ( d G ( y ) 1 , 1 ) + p [ f ( d G ( y ) , 1 ) f ( d G ( y ) 1 , 1 ) ] + ( d G ( y ) p ) f ( d G ( y ) , 2 ) f ( d G ( y ) 1 , 2 ) .
Since p + 1 d G ( y ) n ν + 2 , by keeping in mind condition (xi), from (15) we obtain
BID f ( G ) BID f ( G x ) f ( n ν + 1 , 1 ) + p f ( n ν + 2 , 1 ) f ( n ν + 1 , 1 ) + ( n ν p + 2 ) f ( n ν + 2 , 2 ) f ( n ν + 1 , 2 ) .
By keeping in mind condition (iii), and the fact that p n 2 ν + 1 , from (16) we obtain
BID f ( G ) BID f ( G x ) f ( n ν + 1 , 1 ) + ( n 2 ν + 1 ) f ( n ν + 2 , 1 ) f ( n ν + 1 , 1 ) + ( ν + 1 ) f ( n ν + 2 , 2 ) f ( n ν + 1 , 2 ) .
From (14) and (17), it follows that BID f ( G ) Φ ( n , ν ) , with equality iff G B n , ν . □
The next result’s proof utilizes Theorem 4, and is completely similar to that of Theorem 5, and hence we omit it.
Theorem 6.
Let f : [ 1 , ) × [ 1 , ) ( , ) be a function such that f ( η 1 , η 2 ) = f ( η 2 , η 1 ) . Let η 1 1 and η 2 2 . Also, assume that the following conditions involving f hold:
(i).
η 2 [ f ( 3 , 3 ) + f ( 1 , 3 ) ] > η 2 f ( η 2 + 1 , 2 ) + ( η 2 2 ) f ( 1 , 2 ) + f ( η 2 + 1 , 1 ) + f ( 2 , 2 ) for η 2 3 ;
(ii).
f ( η 1 , 2 ) f ( η 1 , 3 ) + f ( η 2 , 2 ) f ( η 2 , 3 ) + f ( 2 , 2 ) f ( 1 , 3 ) > 0 for η 1 , η 2 { 2 , 3 } ;
(iii).
Function g, defined as g ( η 1 , η 2 ) = f ( η 1 , η 2 ) f ( η 1 , η 2 1 ) , is strictly increasing in η 1 ;
(iv).
2 f ( 3 , 1 ) + 2 f ( 4 , 1 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) 5 f ( 6 , 2 ) f ( 6 , 1 ) 2 f ( 2 , 2 ) f ( 1 , 2 ) > 0 ;
(v).
min { Θ 1 ( η ) , Θ 2 ( η ) , Θ 3 ( η ) } > Θ ( η ) for η 5 , where Θ 1 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 4 ) f ( 3 , 3 ) + 4 f ( 3 , 4 ) + f ( 4 , 4 ) + 2 f ( 4 , 1 ) , Θ 2 ( η ) = ( η 2 ) f ( 3 , 1 ) + ( η 5 ) f ( 3 , 3 ) + 6 f ( 3 , 4 ) + 2 f ( 4 , 1 ) , Θ 3 ( η ) = ( η 1 ) f ( 3 , 1 ) + ( η 3 ) f ( 3 , 3 ) + 4 f ( 3 , 5 ) + f ( 5 , 1 ) , and Θ ( η ) = f ( η + 2 , 1 ) + ( η + 1 ) f ( η + 2 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ;
(vi).
Θ ( 3 ) < min { f ( 1 , 2 ) + 3 f ( 2 , 3 ) + 3 f ( 3 , 3 ) , f ( 1 , 2 ) + 3 f ( 2 , 4 ) + 2 f ( 2 , 3 ) + f ( 3 , 4 ) } ;
(vii).
The function ℏ, defined as
( η 2 ) = f ( η 2 , 2 ) + f ( η 2 , 1 ) f ( η 2 1 , 1 ) + ( η 2 2 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) ,
is strictly decreasing;
(viii).
η 1 f ( η 1 + 1 , 2 ) + f ( η 1 + 1 , 1 ) f ( η 1 + 2 , 1 ) ( η 1 + 1 ) f ( η 1 + 2 , 2 ) + 4 f ( 5 , 2 ) 3 f ( 4 , 2 ) + f ( 5 , 1 ) f ( 4 , 1 ) > 0 for η 1 4 ;
(ix).
( η 1 1 ) [ f ( η 1 , 4 ) f ( η 1 + 1 , 4 ) ] + f ( 2 , η 2 ) f ( η 1 + 1 , η 2 ) + f ( 2 , η 1 ) f ( 1 , η 1 + 1 ) > 0 for η 1 , η 2 { 2 , 3 , 4 } ;
(x).
min { ( 2 η 3 ) f ( 2 , 2 ) + 4 f ( 2 , 3 ) + f ( 3 , 3 ) , 2 ( η 2 ) f ( 2 , 2 ) + 6 f ( 2 , 3 ) , 2 ( η 1 ) f ( 2 , 2 ) + 4 f ( 2 , 4 ) } > 2 f ( η + 3 , 1 ) + ( η + 1 ) f ( η + 3 , 2 ) + ( η 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) for η 3 ;
(xi).
The function Ψ, defined as Ψ ( η 1 , η 2 ) = f ( η 2 1 , 1 ) + η 1 [ f ( η 2 , 1 ) f ( η 2 1 , 1 ) ] + ( η 2 η 1 ) f ( η 2 , 2 ) f ( η 2 1 , 2 ) , is strictly decreasing in η 2 for η 2 η 1 + 1 2 .
If G is an ( n + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then
BID f ( G ) ( n 2 ν + 1 ) f ( n ν + 2 , 1 ) + ( ν + 1 ) f ( n ν + 2 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ,
with equality iff G B n , ν (see Figure 2).
We verified all the conditions in Theorem 5 for the functions corresponding to the SO, AG, RSO, SDD, ES, and MSDD indices (see the paragraph right before Corollary 1 for the definitions of these indices), and hence we have the next result (which follows from Theorem 5).
Corollary 2.
Let BID f be the SO index, or the AG index, or the MSDD index, or the RSO index, or the SDD index, or the ES index. If G is an ( n + 1 ) -size bicyclic graph having a matching number ν ( 3 ) , then
BID f ( G ) ( n 2 ν + 1 ) f ( n ν + 2 , 1 ) + ( ν + 1 ) f ( n ν + 2 , 2 ) + ( ν 3 ) f ( 1 , 2 ) + 2 f ( 2 , 2 ) ,
with equality iff G B n , ν (see Figure 2).
We end this paper with the remark given below.
Remark 1.
We remark that most of our primary results might have their constraints simpler without affecting their conclusions and without making any considerable changes in their proofs. For example, in the statement of Theorem 5, the addition of the assumption that “the function f is strictly increasing” may simplify its several conditions without affecting the theorem’s conclusion. However, the assumption that “the function f is strictly increasing” is not satisfied by the AG index, for instance. Because of these kinds of observations, we did not simplify the existing conditions of our results. Nevertheless, it would be nice to either reduce the number of conditions given in our results (without affecting their conclusions) or modify those conditions in such a way that the resulting statements of these results cover additional BID indices (in addition to the ones mentioned in Corollary 2).

Author Contributions

Conceptualization, A.M.A. (Abeer M. Albalahi), A.A.; Validation, A.M.A. (Abdulaziz M. Alanazi), A.A.B. and A.A.A.; Formal analysis, A.M.A. (Abeer M. Albalahi), A.M.A. (Abdulaziz M. Alanazi) and A.A.A.; Investigation, A.M.A. (Abeer M. Albalahi); Writing—original draft, A.M.A. (Abeer M. Albalahi) and A.A.; Writing—review and editing, A.A., A.M.A. (Abdulaziz M. Alanazi), A.A.B., T.A., H.S. and A.A.A.; Supervision, A.A.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research has been funded by the Scientific Research Deanship at the University of Ha’il—Saudi Arabia through project number RG-24 046.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Bondy, J.A.; Murty, U.S.R. Graph Theory; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  2. Chartrand, G.; Lesniak, L.; Zhang, P. Graphs & Digraphs; CRC Press: Boca Raton, FL, USA, 2016. [Google Scholar]
  3. Gross, J.L.; Yellen, J. Graph Theory and Its Applications, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2005. [Google Scholar]
  4. Trinajstić, N. Chemical Graph Theory, 2nd ed.; CRC Press: Boca Raton, FL, USA, 1992. [Google Scholar]
  5. Wagner, S.; Wang, H. Introduction to Chemical Graph Theory; CRC Press: Boca Raton, FL, USA, 2018. [Google Scholar]
  6. Devillers, J.; Balaban, A.T. Topological Indices and Related Descriptors in QSAR and QSPAR; CRC Press: Boca Raton, FL, USA, 1999. [Google Scholar]
  7. Desmecht, D.; Dubois, V. Correlation of the molecular cross-sectional area of organic monofunctional compounds with topological descriptors. J. Chem. Inf. Model. 2024, 64, 3248–3259. [Google Scholar] [CrossRef] [PubMed]
  8. Leite, L.S.G.; Banerjee, S.; Wei, Y.; Elowitt, J.; Clark, A.E. Modern chemical graph theory. WIREs Comput. Mol. Sci. 2024, 14, e1729. [Google Scholar] [CrossRef]
  9. Adiyanyam, D.; Azjargal, E.; Buyantogtokh, L. Bond incident degree indices of stepwise irregular graphs. AIMS Math 2022, 7, 8685–8700. [Google Scholar] [CrossRef]
  10. Ali, A.; Gutman, I.; Saber, H.; Alanazi, A. On bond incident degree indices of (n,m)-graphs. MATCH Commun. Math. Comput. Chem. 2022, 87, 89–96. [Google Scholar] [CrossRef]
  11. Wei, P.; Liu, M.; Gutman, I. On (exponential) bond incident degree indices of graphs. Discret. Appl. Math. 2023, 336, 141–147. [Google Scholar] [CrossRef]
  12. Li, X.; Peng, D. Extremal problems for graphical function-indices and f-weighted adjacency matrix. Discret. Math. Lett. 2022, 9, 57–66. [Google Scholar]
  13. Gutman, I. Degree-based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef]
  14. Liu, H.; Gutman, I.; You, L.; Huang, Y. Sombor index: Review of extremal results and bounds. J. Math. Chem. 2022, 60, 771–798. [Google Scholar] [CrossRef]
  15. Shang, Y. Sombor index and degree-related properties of simplicial networks. Appl. Math. Comput. 2022, 419, 126881. [Google Scholar] [CrossRef]
  16. Gutman, I. Geometric approach to degree-based topological indices: Sombor indices. MATCH Commun. Math. Comput. Chem. 2021, 86, 11–16. [Google Scholar]
  17. Tang, Z.; Li, Y.; Deng, H. The Euler Sombor index of a graph. Int. J. Quantum Chem. 2024, 124, e27387. [Google Scholar] [CrossRef]
  18. Zheng, R.; Su, P.; Jin, X. Arithmetic-geometric matrix of graphs and its applications. Appl. Math. Comput. 2023, 442, 127764. [Google Scholar] [CrossRef]
  19. Vukičević, D.; Gašperov, M. Bond additive modeling 1. Adriatic indices. Croat. Chem. Acta 2010, 83, 243–260. [Google Scholar]
  20. Ali, A.; Gutman, I.; Redžepović, I.; Albalahi, A.M.; Raza, Z.; Hamza, A.E. Symmetric division deg index: Extremal results and bounds. MATCH Commun. Math. Comput. Chem. 2023, 90, 263–299. [Google Scholar] [CrossRef]
  21. Albalahi, A.M.; Ali, A.; Alanazi, A.M.; Bhatti, A.A.; Hamza, A.E. Harmonic-arithmetic index of (molecular) trees. Contrib. Math. 2023, 7, 41–47. [Google Scholar]
  22. Ali, A.; Alanazi, A.M.; Hassan, T.S.; Shang, Y. On unicyclic graphs with a given number of pendent vertices or matching number and their graphical edge-weight-function indices. Mathematics 2024, 12, 3658. [Google Scholar] [CrossRef]
  23. Zhu, Y.; Liu, G.; Wang, J. On the Randić index of bicyclic conjugated molecules. In Recent Results in the Theory of Randić Index; Gutman, I., Furtula, B., Eds.; University of Kragujevac: Kragujevac, Serbia, 2008; pp. 133–144. [Google Scholar]
Figure 1. The unicyclic graph U n , ν .
Figure 1. The unicyclic graph U n , ν .
Mathematics 12 03806 g001
Figure 2. The bicyclic graph B n , ν .
Figure 2. The bicyclic graph B n , ν .
Mathematics 12 03806 g002
Figure 3. The general form B q ( i ) of the q-order graphs of B q ( i ) , where i { 1 , 2 , , 5 } .
Figure 3. The general form B q ( i ) of the q-order graphs of B q ( i ) , where i { 1 , 2 , , 5 } .
Mathematics 12 03806 g003
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ali, A.; Albalahi, A.M.; Alanazi, A.M.; Bhatti, A.A.; Alraqad, T.; Saber, H.; Attiya, A.A. On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number. Mathematics 2024, 12, 3806. https://doi.org/10.3390/math12233806

AMA Style

Ali A, Albalahi AM, Alanazi AM, Bhatti AA, Alraqad T, Saber H, Attiya AA. On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number. Mathematics. 2024; 12(23):3806. https://doi.org/10.3390/math12233806

Chicago/Turabian Style

Ali, Akbar, Abeer M. Albalahi, Abdulaziz M. Alanazi, Akhlaq A. Bhatti, Tariq Alraqad, Hicham Saber, and Adel A. Attiya. 2024. "On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number" Mathematics 12, no. 23: 3806. https://doi.org/10.3390/math12233806

APA Style

Ali, A., Albalahi, A. M., Alanazi, A. M., Bhatti, A. A., Alraqad, T., Saber, H., & Attiya, A. A. (2024). On Bond Incident Degree Indices of Fixed-Size Bicyclic Graphs with Given Matching Number. Mathematics, 12(23), 3806. https://doi.org/10.3390/math12233806

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop