<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">32271</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2023.032271</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Optimized Evaluation of Mobile Base Station by Modern Topological Invariants</article-title>
<alt-title alt-title-type="left-running-head">Optimized Evaluation of Mobile Base Station by Modern Topological Invariants</alt-title>
<alt-title alt-title-type="right-running-head">Optimized Evaluation of Mobile Base Station by Modern Topological Invariants</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Hamid</surname><given-names>Khalid</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Iqbal</surname><given-names>Muhammad Waseem</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>Waseem.iqbal@superior.edu.pk</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Ashraf</surname><given-names>Muhammad Usman</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alghamdi</surname><given-names>Ahmed Mohammed</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Bahaddad</surname><given-names>Adel A.</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Almarhabi</surname><given-names>Khalid Ali</given-names></name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science, Superior University</institution>, <addr-line>Lahore, 54000</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Software Engineering, Superior University</institution>, <addr-line>Lahore, 54000</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, GC Women University</institution>, <addr-line>Sialkot, 53310</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Software Engineering, College of Computer Science and Engineering, University of Jeddah</institution>, <addr-line>21493</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Information System, Faculty of Computing and Information Technology, King Abdulaziz University</institution>, <addr-line>Jeddah, 21589</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Computer Science, College of Computing in Al-Qunfudah, Umm Al-Qura University</institution>, <addr-line>Makkah, 24381</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Muhammad Waseem Iqbal. Email: <email>Waseem.iqbal@superior.edu.pk</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-08-16"><day>16</day>
<month>08</month>
<year>2022</year></pub-date>
<volume>74</volume>
<issue>1</issue>
<fpage>363</fpage>
<lpage>378</lpage>
<history>
<date date-type="received"><day>12</day><month>5</month><year>2022</year></date>
<date date-type="accepted"><day>20</day><month>6</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Hamid et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Hamid et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_32271.pdf"></self-uri>
<abstract>
<p>Due to a tremendous increase in mobile traffic, mobile operators have started to restructure their networks to offload their traffic. New research directions will lead to fundamental changes in the design of future Fifth-generation (5G) cellular networks. For the formal reason, the study solves the physical network of the mobile base station for the prediction of the best characteristics to develop an enhanced network with the help of graph theory. Any number that can be uniquely calculated by a graph is known as a graph invariant. During the last two decades, innumerable numerical graph invariants have been portrayed and used for correlation analysis. In any case, no efficient assessment has been embraced to choose, how much these invariants are connected with a network graph. This paper will talk about two unique variations of the hexagonal graph with great capability of forecasting in the field of optimized mobile base station topology in setting with physical networks. Since K-banhatti sombor invariants (KBSO) and Contrharmonic-quadratic invariants (CQIs) are newly introduced and have various expectation characteristics for various variations of hexagonal graphs or networks. As the hexagonal networks are used in mobile base stations in layered, forms called honeycomb. The review settled the topology of a hexagon of two distinct sorts with two invariants KBSO and CQIs and their reduced forms. The deduced outcomes can be utilized for the modeling of mobile cellular networks, multiprocessors interconnections, microchips, chemical compound synthesis and memory interconnection networks. The results find sharp upper bounds and lower bounds of the honeycomb network to utilize the Mobile base station network (MBSN) for the high load of traffic and minimal traffic also.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Hexagonal networks</kwd>
<kwd>k-banhatti sombor invariants</kwd>
<kwd>maple</kwd>
<kwd>network graph</kwd>
<kwd>artificial intelligence</kwd>
<kwd>contraharmonic-quadratic invariants</kwd>
<kwd>honeycomb</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Currently, there has been an enormous expansion in rush hour traffic demand for communication services in cellular mobile networks. The frequency spectrum dispensed to the frameworks is restricted; thus, how to utilize frequency diverts most efficiently whether the frameworks depend on the Frequency division multiple access (FDMA) or the Time division multiple access (TDMA) [<xref ref-type="bibr" rid="ref-1">1</xref>]. FDMA is the correspondence procedure utilized in communicating, land-versatile two-way radio, and so forth. It starts with a band of frequencies, which is distributed by the Federal communications commission (FCC). This band of frequency is additionally partitioned into a few thin groups of frequencies, where every frequency, otherwise called a channel, is utilized for full-duplex correspondence. The correspondence connection is kept up within the two headings, either in the frequency space or in the time area. This is represented by two fundamental modes of tasks known as the Frequency division duplex (FDD) and Time division duplex (TDD). These subjects, alongside FDMA range the executives and its credits, are introduced in this section [<xref ref-type="bibr" rid="ref-2">2</xref>]. In new mobile radio frameworks, TDMA is utilized. Every versatile hub doles out frequencies for the utilization of the period on a repeating premise. Generally, a telecaster doesn&#x2019;t have full admittance to the game&#x2019;s data transmission for a specific timeframe. The frequency of the framework, then again, is partitioned into sub-groups, each involving TDMA for shared confirmation [<xref ref-type="bibr" rid="ref-3">3</xref>]. The network structure used in a cellular network system is a hexagonal structure with two variants [<xref ref-type="bibr" rid="ref-4">4</xref>]. The study technique is used to evaluate and optimize the physical layout of the mobile base station to fulfill the optimal traffic demand in rush hours. It can be done by solving the topology of cellular networks by modern invariants and predicting the physical characteristics of the honeycomb network used in the mobile base station network.</p>
<p>A mobile telephone base station is a transmission and gathering station in a decent area, comprising of at least one get/send receiving wire, microwave dish and electronic hardware used to deal with cell traffic. It fills in as an extension between all mobile clients on a phone and interfaces mobile calls to the mobile exchanging focus. It is fundamentally the main issue that all clients interface within a center and talked style network [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>In material sciences, honeycomb networks play a fundamental part in various fields, particularly in wireless base stations, image processing and graphics. Honeycomb networks are formed by the iterative utilization of hexagonal tiles in a particular plan. We mean the n-layered honeycomb network with hexagons among focal and boundary hexagons by HC<sub>n</sub>. HC<sub>n</sub> are built by adding a layer of hexagon around HC<sub>n&#x2212;1.</sub> Its evaluation is also useful in other fields of computer science like microprocessors, memory interconnection and processor interconnection. As another arising science is developed with the help of computer sciences, mathematics, and chemistry called cheminformatics, whose significant segments incorporate Quantitative structure-activity relationship (QSAR) and Quantitative structure-property relationships (QSPR) and the segments can add to the examination of the physicochemical characteristics of synthetic mixtures. QSAR is a modeling tool used to solve the topology of networks or structure of compounds and model the efficient and best performer networks or structures. QSPR is also a modeling tool that correlates the properties of network structures with the help of mathematical equations or expressions. It also provides the quantitative relationship between properties of networks or chemical structures. Angles of topology in the form of numeric values can be portrayed with the help of a graph because of invariance. It is done due to the automorphism property of the graph. A k-banhatti sombor index is a topological index which is a number associated with a network graph that captures the symmetry of the network structure and provides a scientific language for predicting the characteristics of the network. In the fields of computer sciences and chemistry, there are a lot of applications of graph theory [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>On the other hand, V. R. Kulli in 2022, define another vertex degree-based invariant graph named Quadratic-contraharmonic indices (QCI) are used to get the sharp lower and upper limits of the related networks and the characteristics of the network showing up at the boundaries. There are two varieties of quadratic-contraharmonic indices, the first is a QCI and the second one is a CQI [<xref ref-type="bibr" rid="ref-7">7</xref>]. A QCI is a topological invariant which is a number related to a network graph that gets the evenness of the network design and gives a coherent language to expecting the characteristics of the network.</p>
<p>The research work concentrates on the topological properties and solutions of mobile base station networks. The topological properties include lower bounds, upper bounds and prediction qualities of deduced mathematical results to resolve the issues related to connectivity, scalability, routing, node density, mobility among the nodes, link formation between the nodes modeling the network and simulation. Though mobile base station networks are modeled through these solved results. So, engineers and manufacturers foresee concerning networks before manufactured or developing them. After that Topological invariants (TIs) allow us to accumulate information about algebraic structures and mathematically predict hidden properties of various networks like hexagons and honeycomb etc.</p>
<p>This paper first introduces the problem statement with Honeycomb and regular hexagonal networks and KBSO and QCIs, secondly review the literature, thirdly discusses objectives, significance, research gap, and method in the research methodology section, in the fourth section analyze data and in the last section write results and conclude the research. The study has implications in the fields of computer science, physics, chemistry, mathematics, and bioinformatics for modeling purposes of networks, cellular networks, and chemical compounds. KBSO topological invariants and QCIs allow us to accumulate information about algebraic structures and mathematically predict hidden properties of various structures such as Honeycomb and regular hexagonal networks used in mobile base station networks.</p>
</sec>
<sec id="s2"><label>2</label><title>Background</title>
<p>In a cellular mobile communication framework, to treat the traffic demand at the necessary grade of administration, some number of frequency channels ought to be allocated to every cell of the framework under the electromagnetic limitations, for example, co-channel imperative, contiguous channel requirement and co-site imperative. The quantity of frequency channels apportioned to a cellular framework is limited on account of the restricted frequency spectrum [<xref ref-type="bibr" rid="ref-8">8</xref>]. In any case, lately, interest in frequency channels has been expanded definitely. Consequently, how to appoint the expected number of frequency channels to every cell under the above requirements turns into a significant issue. This issue is called FAP. It has been broadly utilized as a choice measure of FAP to limit the most extreme range of the frequency channels utilized in a cellular framework [<xref ref-type="bibr" rid="ref-9">9</xref>]. This paper study enhances the efficiency of mobile cellular networks by evaluating the cellular base station networks&#x2019; topology mathematically by newly prepared topological indices. So issues are started to resolve from the gross root level [<xref ref-type="bibr" rid="ref-10">10</xref>]. This study solved and optimized the MBSNs in context with the topology of the network.</p>
</sec>
<sec id="s3"><label>3</label><title>Literature Review</title>
<p>The calculation of the irregularity indices of honeycomb networks, hexagonal networks, oxide networks, and silicate networks is done. The results are very helpful in understanding the behavior of different computer networks and chemical networks. After understanding these formulas different researchers can construct their own best networks in chemistry and computer also [<xref ref-type="bibr" rid="ref-11">11</xref>]. Further, the study elaborates that graph theory is a field through which they calculate topological indices for finding the properties of different chemicals without performing any types of experiments on them. It may be understanding only mathematical formulas or equations which are deduced for them. It also calculates topological indices form-polynomial block shift networks which are a part of different chemical compounds with the help of the division of edge [<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>The readings explain that another arising science is cheminformatics which is a combination of chemistry, mathematics, and computer science. It is the main concern and constituent part is QSAR and QSPR which mainly explore physicochemical properties of chemicals and their structures. This paper tended to the OTIS traded networks and bi-swapped networks and investigated their topological indices. They decided the overall randi &#x0107;, general aggregate availability, first and second zagreb, first and second multiple zagreb, hyper zagreb molecule bond, and mathematical indices for both the group of networks by considering the premise network as way Pn and k-customary graph Rk. They likewise gave express formulae for ABC4 and GA5 indices of these networks with the premise Rk network [<xref ref-type="bibr" rid="ref-13">13</xref>].</p>
<p>In the view of the study, the headway of large-scale integrated circuit innovation has empathy for the development of complex interconnected networks. Graph theory gives a key apparatus to designing and evaluating such networks. Connected networks and graph theory give a detailed comprehension of these connected themes. Chemical graph theory is a part of numerical science wherein they apply devices of graph theory to demonstrate the chemical wonder numerically. In-network vertex addresses network hub like PC, switch, switch some other gadget and an edge addresses a network path through which transmission completed. These topological indices or invariants are also numeric values related to computer networks, their interconnections, their properties, etc. It calculates the different topological indices of eccentricity-based for a binary tree up to k-level. The results of a paper can be used for computer networks and chemical networks in topological characterization [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>Chemical graph theory manages the essential properties of a molecular graph. In graph theory, we relate molecular descriptors to the properties of molecular structures. Here, we calculate some Banhatti molecular descriptors for water-dissolvable dendritic uni-molecular polyether micelle. Our outcomes end up being extremely important to comprehend the way of behaving of water-dissolvable dendritic unimolecular polyether micelle as a drug-delivery agent [<xref ref-type="bibr" rid="ref-15">15</xref>].</p>
<p>Multiprocessor interconnection networks are habitually expected to join numerous indistinguishable processor-memory matches that are rehashed everyone is alluded to as a handling hub [<xref ref-type="bibr" rid="ref-16">16</xref>]. Message passing instead of divided memory is much of the time utilized for synchronization of correspondence among the handling hubs for the execution of the program. Multiprocessor interconnection networks are most drawn in networks because of the accessibility of strong and cheap microchips and memory chips. By rehashing normal polygons, intermittent plane decorations can be handily constructed [<xref ref-type="bibr" rid="ref-17">17</xref>]. For direct interconnection organizations, this plan is vital as it offers high worldwide execution. A few equal organizations that start from well-known networks are hexagonal and honeycomb [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>With the assistance of the topological index (TI), we can figure out various properties of molecular structures. TI empowers us to connect a number with a molecular construction. Various mixtures can be changed into various shapes like trees, cycles, and so on. This paper is about the reverse Zagreb indices, hyper turn around Zagreb invariants, and their polynomials for metal-natural structures [<xref ref-type="bibr" rid="ref-19">19</xref>].</p>
<p>In the field of chemical graph theory, topological indices are vital. The topological index is a mathematical amount reliant upon various invariants or molecular graph qualities. In the current article, the topological indices of para desert plants chain graph are determined, for example, iota bond availability, mathematical number juggling, first k-banhatti, second k-banhatti, first k-hyper banhatti, second k-hyper banhatti, adjusted first k-banhatti, altered second k-banhatti and consonant k-banhatti utilizing their M-polynomials by the equations given in. Graphical examination of the discoveries is additionally shown the capacity to recuperate the topological indices [<xref ref-type="bibr" rid="ref-20">20</xref>].</p>
<p>To increase the effectiveness of observing and conservation endeavors, it is of key importance to foster sound quantitative techniques that can indicate which key areas and site components play a noticeable and critical job in the working of territory mosaics. In this article, a new emerging study will compute different indices of bridge networks. The results will play a vital role in determining the properties of these networks and their uses in the computer industry, electronics, chemistry, pharmacy, etc. It will also perform index analysis on certain networks which may be beneficial for people who are working in the field of computer science, mathematics and chemistry also. In the end, formulate a mathematical formula to construct a computer network or processor design or chemical compound, check the properties of concerning before and also check the feasibility of anyone which discuss earlier&#x00A0;[<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<p>Chemical graph theory is a subfield of numerical chemistry that is exceptionally valuable in the advancement of the computational examination of chemical mixtures. A chemical graph is the result of the molecular design by applying some graph The exhibit of chemical mixtures with the M-polynomials is a creating thought and the M-polynomial of various molecular structures upholds us to ascertain numerous topological indices. In this paper we ascertain M-polynomial and topological indices for the starphene graph, then, at that point, we recuperate various topological indices utilizing the M-polynomials [<xref ref-type="bibr" rid="ref-22">22</xref>].</p>
<p>The momentum disclosure of various kinds of nanostructures has propelled scientists to concentrate on the uses of these structures in various fields. In this review, the study dissected the boron three-sided nanotube through topological indices. M-polynomial of a boron three-sided nanotube can recuperate the topological indices which are reliant upon the level of the vertex. We have introduced the outcomes in a graphical structure [<xref ref-type="bibr" rid="ref-23">23</xref>].</p>
<p>These topological indices can contribute to getting the natural, chemical and actual qualities of a molecule. Along these lines, the topological index plays a vital part in addressing the chemical design of a particle in a genuine number and is utilized to communicate the atom which is tried. These outcomes are useful in understanding and determining the physicochemical properties of these chemical structures [<xref ref-type="bibr" rid="ref-24">24</xref>].</p>
<p>Another study told that topological indices and network polynomials are invariants of molecular graphs. Expected properties of structures of molecules can be studied with the help of invariants. In benzene networks, honeycomb networks are significantly used. In the current article, new topological portrayals of honeycomb networks are given as degree-based descriptors. They, for the first time, used some consistency indices and a few co-indices identified with this network without a line graph and complement also. These indices of honeycomb networks are very much effective to understand the physicochemical properties of chemicals. These realities might be valuable for individuals working in software engineering and science who experience honeycomb networks. An ideal level of a specific index can be acquired by putting a limitation on n [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p>Another study conveyed that since computers are a tool used in the world as a source of information, they increase in numbers numerously. To such an extent, today, it is hard to track down any space, logical or other, which is not dependent on their application. Indeed, even general sets of laws have been affected by novel processing and data strategies. A considerable lot of these QSAR procedures depend on the utilization of structural boundaries, which are mathematical arrangements that classify helpful structural data and empathy relationships among structure and natural properties&#x00A0;[<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
<p>KBSO index and its reduced version have a good potential for prediction in the field of computer science, mathematics, chemistry, pharmacy, informatics, and biology in context with physical and chemical structures and networks. On the other hand, the CQI and its reverse form are also having the same prediction quality as mentioned earlier.</p>
</sec>
<sec id="s4"><label>4</label><title>Research Methodology</title>
<p>The methodology is based on quantitative inquiry. The purpose of this research is to explore and develop an understanding of critical concerns error-free, failure-free, efficient utilization and having advanced capabilities in cellular networks, interconnection networks of processors and chemical compound structures.</p>
<sec id="s4_1"><label>4.1</label><title>Objectives</title>
<p>The main objective of this study is to investigate the topological invariants of mobile cellular networks like honeycomb and regular hexagonal networks. The study finds out the intensity of seriousness of topological indices in certain networks like mobile cellular networks, interconnection networks of processors, parallel processors, chemical structures, etc. This paper study explains the k-banhatti sombor indices, their reduced form, CQIs, and its other variant. It also discusses the benefits of each. This article explains and is aware recent use of KBSO inavariants and QCI and CQI. Its prime objective is to develop formulas so that it can check the topology and performance of mobile base station networks without performing experiments and also before manufacturing them. The work deduced some results which are used in the modeling of mobile-cellular networks.</p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Significance</title>
<p>The study is very significant these days because it creates awareness about Topological invariants of certain networks like cellular networks, interconnection networks of processors and chemical structures for efficient utilization. It is also discovering new and significant solutions or formulas for modeling mobile networks [<xref ref-type="bibr" rid="ref-27">27</xref>].</p>
</sec>
<sec id="s4_3"><label>4.3</label><title>Hypothesis</title>
<p>The study considers the following hypothesis for the development of mobile cellular networks because vendors and manufacturers need error-free, failure-free and best performer mobile-cellular networks [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
</sec>
<sec id="s4_4"><label>4.4</label><title>Contribution</title>
<p>The expected contribution of this research is to analyze how existing mobile base station networks can be improved by optimizing their adaptability. During the said research honeycomb and regular hexagonal were solved and modeled through deduced results by topological invariants. These results will be developed over the solution of networks graphically by freshly prepared topological indices. Existing MBSNs have been studied for topological perspectives and QSPR and QSAR models are developed and analyzed. The relation between lower bounds and upper bounds of the network or graph has been discovered. The outcomes of the research will provide designing guidelines for advanced MBSNs and chemical compound interconnection networks [<xref ref-type="bibr" rid="ref-29">29</xref>].</p>
</sec>
<sec id="s4_5"><label>4.5</label><title>Method</title>
<p>This systematic study will take an existing Honeycomb and regular hexagonal networks, associate it with a graph and solve the topology of the graph with the help of k-banhatti Sombor indices, its reduced form, QCI and the CQI. The concerning results in the form of formulas will compare with existing results and used for modeling purposes of cellular networks [<xref ref-type="bibr" rid="ref-30">30</xref>]. This model is particularly disrupting as it handled the geography of a mobile base station network including regular hexagonal network and honeycomb network in numeric and graphical construction and gives careful results. After examination, an entertainment device maple is used for the affirmation and endorsement of results.</p>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Experimental Results</title>
<p>A honeycomb graph is a graph obtained from several graphs of <italic>HC<sub>n&#x2212;1</sub></italic> associated with each in a layer. KBSO indices have two variants, k-banhatti sombor index and its reduced version.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msqrt><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>&#x03F1;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:msqrt></mml:math></disp-formula></p>
<p>The graph theory introduced many graph invariants and studied also but <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref> shows the KBSO index which will be used for the solution of honeycomb and regular hexagonal networks mentioned in <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-4">4</xref>. This invariant has a capability to calculate and found sharp upper bounds at the boundaries.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:munder><mml:mi>d</mml:mi><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>&#x03F1;</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula></p>
<p>The graph theory introduced many graph invariants and studied also but <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> shows the KBSO reduced index which will be used for the solution of honeycomb and regular hexagonal networks in <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-4">4</xref>. This invariant has a capability to calculate and found sharp lower bounds at the boundaries.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The graph theory introduced many graph invariants and studied also but <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> shows the CQI which will be used for the solution of honeycomb and regular hexagonal networks in <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-4">4</xref>. This invariant has a capability to calculate and found sharp upper bounds at the boundaries.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>The graph theory introduced many graph invariants and studied also but <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> shows the QCI which will be used for the solution of honeycomb and regular hexagonal networks in <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-4">4</xref>. This invariant has a capability to calculate and found sharp lower bounds at the boundaries.</p>
<p>de &#x003D; du &#x002B; dv&#x2013;2</p>
<p><xref ref-type="table" rid="table-1">Tab. 1</xref> describes the edge partitions with their frequencies of honeycomb network given in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. The study found vertices of G are either 5, 7 or 9 shown in <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-1">Fig. 1</xref> also. After the calculation the number of edges formed are 6, 12(n &#x2212; 1), 6(n &#x2212; 1) and 9n<sup>2</sup> &#x2013; 21n &#x002B; 12 shown in above table.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Edge partition of honeycomb network</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">&#x0395;</th>
<th align="left">&#x03B5; (du, dv)</th>
<th align="left">de</th>
<th align="left">&#x03B5;(du, de)</th>
<th align="left">Recurrence</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">&#x03B5;<sub>1</sub></td>
<td align="left">&#x03B5;(5,5)</td>
<td align="left">8</td>
<td align="left">&#x03B5;(5, 8)</td>
<td align="left">6</td>
</tr>
<tr>
<td align="left">&#x03B5;<sub>2</sub></td>
<td align="left">&#x03B5;(5,7)</td>
<td align="left">10</td>
<td align="left">&#x03B5;(5, 10)</td>
<td align="left">12(n &#x2212; 1)</td>
</tr>
<tr>
<td align="left">&#x03B5;<sub>3</sub></td>
<td align="left">&#x03B5;(7,9)</td>
<td align="left">14</td>
<td align="left">&#x03B5;(7, 14)</td>
<td align="left">6(n &#x2212; 1)</td>
</tr>
<tr>
<td align="left">&#x03B5;<sub>4</sub></td>
<td align="left">&#x03B5;(9,9)</td>
<td align="left">16</td>
<td align="left">&#x03B5;(9, 16)</td>
<td align="left">9n<sup>2</sup> &#x2013; 21n &#x002B; 12</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s5_1"><label>5.1</label><title>Main Results of Honeycomb Network</title>
<p><xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows honeycomb networks in which n-number of layers of hexagonal networks are exist and used in mobile base stations network. Every cell has 6 vertices and 6 edges. Every cell is surrounded by 6 other hexagonal cells which make it the structure of honeycomb network for mobile base station.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Honeycomb network with n number of cells (HC<sub>n</sub>)</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-1.png"/></fig>
<sec id="s5_1_1"><label>5.1.1</label><title>Honeycomb Graph</title>
<p>Let G &#x003D; HC<sub>n</sub> the n-layered honeycomb network with n hexagons among middle and boundary hexagons by HC<sub>n</sub>. HC<sub>n</sub> is developed by adding a layer of hexagon around HC<sub>n&#x2212;1</sub> (see <xref ref-type="fig" rid="fig-4">Fig. 4</xref>). The order and size of HC<sub>n</sub> are 6n<sup>2</sup> and 9n<sup>2</sup>&#x2013;3n, separately. <xref ref-type="table" rid="table-1">Tab. 1</xref>, explains in detail the edges partition.</p>
</sec>
<sec id="s5_1_2"><label>5.1.2</label><title>Theorem 1</title>
<p>Let G be a graph of <italic>honeycomb</italic>, then, KBSO and KBSO<sub>red</sub> indices are
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>6</mml:mn><mml:msqrt><mml:mn>89</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mn>5</mml:mn><mml:msqrt><mml:mn>5</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>7</mml:mn><mml:msqrt><mml:mn>5</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn>337</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>6</mml:mn><mml:msqrt><mml:mn>65</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:msqrt><mml:mn>97</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn>205</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>153</mml:mn><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>357</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>204</mml:mn></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref> represent the proven results of the graph of honeycomb mentioned in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>.</p>
</sec>
<sec id="s5_1_3"><label>5.1.3</label><title>Investigation of Honeycomb Graphs by KBSO Indices</title>
<p><italic>Proof</italic>
<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:munder><mml:mspace width="thickmathspace" /><mml:msqrt><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>&#x03F1;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:msqrt></mml:math></disp-formula>
<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:msqrt><mml:msup><mml:mn>5</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>8</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mn>5</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mn>7</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>14</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>&#x2212;</mml:mo><mml:msqrt><mml:msup><mml:mn>9</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>16</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-3">
<mml:math id="mml-ueqn-3" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">O</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:msqrt><mml:mn mathvariant="bold">89</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mn mathvariant="bold">5</mml:mn><mml:msqrt><mml:mn mathvariant="bold">5</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn mathvariant="bold">7</mml:mn><mml:msqrt><mml:mn mathvariant="bold">5</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="bold">337</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">9</mml:mn><mml:msup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">21</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-4">
<mml:math id="mml-ueqn-4" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:munder><mml:mi>d</mml:mi><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:munder><mml:mspace width="thickmathspace" /><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>
<disp-formula id="ueqn-5">
<mml:math id="mml-ueqn-5" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>8</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>5</mml:mn><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>10</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-6">
<mml:math id="mml-ueqn-6" display="block"><mml:mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>7</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>14</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>16</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-7">
<mml:math id="mml-ueqn-7" display="block"><mml:msub><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mi mathvariant="bold-italic">B</mml:mi><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mi mathvariant="bold-italic">O</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:msqrt><mml:mn mathvariant="bold">65</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="bold">97</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="bold">205</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn mathvariant="bold">153</mml:mn><mml:msup><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">357</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mn mathvariant="bold">204</mml:mn></mml:math></disp-formula></p>
<p><xref ref-type="fig" rid="fig-2">Fig. 2</xref> results show little sharp lower and upper bounds (<xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> &#x0026; <xref ref-type="disp-formula" rid="eqn-6">(6)</xref>) of KBSO indices and their reduced form in red and blue lines respectively.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>KBSO and KBSO<sub>red</sub> for honeycomb network <bold>(HC<sub>n</sub>)</bold></title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-2.png"/></fig>
</sec>
<sec id="s5_1_4"><label>5.1.4</label><title>Theorem 2</title>
<p>Let G be a graph of <italic>honeycomb</italic>, then, CQI and QCI indices are
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>3</mml:mn><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>4</mml:mn></mml:mfrac><mml:msqrt><mml:mn>11</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>16</mml:mn></mml:mfrac><mml:msqrt><mml:mn>179</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>4</mml:mn><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>4</mml:mn><mml:mn>11</mml:mn></mml:mfrac><mml:msqrt><mml:mn>11</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn>16</mml:mn><mml:mn>179</mml:mn></mml:mfrac><mml:msqrt><mml:mn>179</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn>2</mml:mn><mml:mn>3</mml:mn></mml:mfrac><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-7">Eqs. (7)</xref> and <xref ref-type="disp-formula" rid="eqn-8">(8)</xref> represent the proven results of the graph of the honeycomb network mentioned in <xref ref-type="fig" rid="fig-1">Fig. 1</xref> with the help of CQI and QCI.
<disp-formula id="ueqn-8">
<mml:math id="mml-ueqn-8" display="block"><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mspace width="thickmathspace" /><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="ueqn-9">
<mml:math id="mml-ueqn-9" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>5</mml:mn><mml:mo>+</mml:mo><mml:mn>5</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>7</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>5</mml:mn><mml:mo>+</mml:mo><mml:mn>7</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>7</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>7</mml:mn><mml:mo>+</mml:mo><mml:mn>9</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>9</mml:mn><mml:mo>+</mml:mo><mml:mn>9</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-10">
<mml:math id="mml-ueqn-10" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn mathvariant="bold">3</mml:mn><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">4</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">11</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">16</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">179</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">2</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">9</mml:mn><mml:msup><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">21</mml:mn><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-11">
<mml:math id="mml-ueqn-11" display="block"><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="ueqn-12">
<mml:math id="mml-ueqn-12" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:mfrac><mml:mrow><mml:mn>5</mml:mn><mml:mo>+</mml:mo><mml:mn>5</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>5</mml:mn><mml:mo>+</mml:mo><mml:mn>7</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>7</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>12</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>7</mml:mn><mml:mo>+</mml:mo><mml:mn>9</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>7</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mn>9</mml:mn><mml:mo>+</mml:mo><mml:mn>9</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mn>9</mml:mn><mml:msup><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn>21</mml:mn><mml:mrow><mml:mtext>n</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-13">
<mml:math id="mml-ueqn-13" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn mathvariant="bold">4</mml:mn><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">4</mml:mn><mml:mn mathvariant="bold">11</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">11</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">16</mml:mn><mml:mn mathvariant="bold">179</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">179</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">6</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">2</mml:mn><mml:mn mathvariant="bold">3</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn mathvariant="bold">9</mml:mn><mml:msup><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mrow><mml:mn mathvariant="bold">2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mn mathvariant="bold">21</mml:mn><mml:mrow><mml:mi mathvariant="bold">n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mn mathvariant="bold">12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>

<p><xref ref-type="fig" rid="fig-3">Fig. 3</xref> results represesnt sharp upper and lower bounds (<xref ref-type="disp-formula" rid="eqn-7">Eqs. (7)</xref> &#x0026; <xref ref-type="disp-formula" rid="eqn-8">(8)</xref>) of KBSO indices and their reduced form in red and blue lines respectively.</p>
<fig id="fig-3"><label>Figure 3</label><caption><title>CQI and QCI for honeycomb network <bold>(HC<sub>n</sub>)</bold></title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-3.png"/></fig>
</sec>
</sec>
<sec id="s5_2"><label>5.2</label><title>Main Results of Regular Hexagonal Cell Network</title>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows regular hexagonal networks used in mobile base stations network with six sides consecutively attached.</p>
<fig id="fig-4"><label>Figure 4</label><caption><title>Regular hexagonal cells network</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-4.png"/></fig>
<sec id="s5_2_1"><label>5.2.1</label><title>Regular Hexagonal Cells Network</title>
<p>Let G &#x003D; RH<sub>m, n</sub>. The vertices of G are both of degree 2 or 3, as referenced in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. By estimation, we get that G has 4mn &#x002B; 4m &#x002B; m &#x2212; 2 vertices and 6mn &#x002B; 5m &#x002B; n &#x2212; 4 edges. In G, there are three kinds of edges in light of the level of end vertices of each edge <xref ref-type="table" rid="table-2">Tab. 2</xref> provides a detailed description of the edge set.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Edge partition of regular hexagonal cells network</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">&#x03B5;</th>
<th align="left">&#x03B5; (du, dv)</th>
<th align="left">de</th>
<th align="left">&#x03B5;(du, de)</th>
<th align="left">Recurrence</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">&#x03B5;<sub>1</sub></td>
<td align="left">&#x03B5;<sub>(2 ,2)</sub></td>
<td align="left">2</td>
<td align="left">&#x03B5;<sub>(2 ,2)</sub></td>
<td align="left">2n &#x002B; 4</td>
</tr>
<tr>
<td align="left">&#x03B5;<sub>2</sub></td>
<td align="left">&#x03B5;<sub>(2 ,3)</sub></td>
<td align="left">3</td>
<td align="left">&#x03B5;<sub>(2 ,3)</sub></td>
<td align="left">4m &#x002B; 4n &#x002B; 4</td>
</tr>
<tr>
<td align="left">&#x03B5;<sub>3</sub></td>
<td align="left">&#x03B5;<sub>(3 ,3)</sub></td>
<td align="left">4</td>
<td align="left">&#x03B5;<sub>(3 ,4)</sub></td>
<td align="left">6mn &#x002B; m &#x2212; 5n &#x2212; 	4</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> describes the edge partitions with frequencies regarding them in the graph of the regular hexagonal cells network given in <xref ref-type="fig" rid="fig-4">Fig. 4</xref> with frequencies. The study found vertices of G are either 2 or 3 shown in <xref ref-type="table" rid="table-1">Tab. 1</xref> and <xref ref-type="fig" rid="fig-1">Fig. 1</xref> also. After the calculation the number of edges formed are 2n &#x002B; 4, 4m &#x002B; 4n &#x002B; 4 and 6mn &#x002B; m &#x2212; 5n &#x2212; 4 shown in above table.</p>
</sec>
<sec id="s5_2_2"><label>5.2.2</label><title>Theorem 3</title>
<p>Let G be a graph of regular hexagonal network Then <italic>KBSO</italic> and KB<italic>SO<sub>red</sub></italic> are
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:msqrt><mml:mn>2</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn>13</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>30</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>5</mml:mn><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>25</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>20</mml:mn></mml:math></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:mn>2</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn>5</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn>13</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-9">Eqs. (9)</xref> and <xref ref-type="disp-formula" rid="eqn-10">Eqs. (10)</xref> represent the proven results of the graph of regular hexagonal mentioned in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. with the help of the KBSO Index and its reduced form.</p>
</sec>
<sec id="s5_2_3"><label>5.2.3</label><title>Investigation of Regular Hexagonal by K-Banhatti Sombor Indices</title>
<p><italic>Proof</italic>
<disp-formula id="ueqn-14">
<mml:math id="mml-ueqn-14" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:msqrt><mml:msubsup><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:msup><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>
<disp-formula id="ueqn-15">
<mml:math id="mml-ueqn-15" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>3</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mn>3</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mn>4</mml:mn><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-16">
<mml:math id="mml-ueqn-16" display="block"><mml:mrow><mml:mtext mathvariant="italic">KBSO </mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow><mml:msqrt><mml:mn mathvariant="bold">2</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="bold">13</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">30</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">5</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">25</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">20</mml:mtext></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-17">
<mml:math id="mml-ueqn-17" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:munder><mml:mi>d</mml:mi><mml:mo>&#x005F;</mml:mo></mml:munder><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>u</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi></mml:mi><mml:mi>&#x03F1;</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>
<disp-formula id="ueqn-18">
<mml:math id="mml-ueqn-18" display="block"><mml:mi>K</mml:mi><mml:mi>B</mml:mi><mml:mi>S</mml:mi><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-19">
<mml:math id="mml-ueqn-19" display="block"><mml:mtext>&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;</mml:mtext><mml:mo>+</mml:mo><mml:msqrt><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-20">
<mml:math id="mml-ueqn-20" display="block"><mml:msub><mml:mrow><mml:mtext mathvariant="bold">KBSO</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">red</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">G</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msqrt><mml:mn mathvariant="bold">2</mml:mn></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mn mathvariant="bold">5</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msqrt><mml:mrow><mml:mtext mathvariant="bold">13</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">6</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo mathvariant="bold">+</mml:mo><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo mathvariant="bold">&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">5</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo mathvariant="bold">&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:msqrt></mml:math></disp-formula></p>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> shows the results (<xref ref-type="disp-formula" rid="eqn-9">Eqs. (9)</xref> &#x0026; <xref ref-type="disp-formula" rid="eqn-10">(10)</xref>) of CQI and QCI in red and blue colors respectively in the 3D version which shows sharp upper and lower bounds of a network.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>KBSO and KBSO<sub>red</sub> for regular hexagonal network</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-5.png"/></fig>
</sec>
<sec id="s5_2_4"><label>5.2.4</label><title>Theorem 4</title>
<p>Let G be a graph of Regular Hexagonal Network Then <italic>CQI and QCI</italic> are
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>5</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn>17</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>2</mml:mn><mml:mn>3</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>5</mml:mn><mml:mn>17</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn>17</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn>2</mml:mn><mml:mn>3</mml:mn></mml:mfrac><mml:msqrt><mml:mn>3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>6</mml:mn><mml:mi>m</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn><mml:mi>n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-11">Eqs. (11)</xref> and <xref ref-type="disp-formula" rid="eqn-12">(12)</xref> represent the proven results of the graph of regular hexagonal mentioned in <xref ref-type="fig" rid="fig-4">Fig. 4.</xref></p>
</sec>
<sec id="s5_2_5"><label>5.2.5</label><title>Investigation of Regular Hexagonal Network by CQIs</title>
<p><italic>Proof</italic>
<disp-formula id="ueqn-21">
<mml:math id="mml-ueqn-21" display="block"><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:mspace width="thickmathspace" /><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="ueqn-22">
<mml:math id="mml-ueqn-22" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>rs</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>3</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mrow><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-23">
<mml:math id="mml-ueqn-23" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">2</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">5</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn mathvariant="bold">17</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">1</mml:mn><mml:mn mathvariant="bold">2</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">6</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">5</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="ueqn-24">
<mml:math id="mml-ueqn-24" display="block"><mml:mi>Q</mml:mi><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>u</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="ueqn-25">
<mml:math id="mml-ueqn-25" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>C</mml:mi><mml:mi>Q</mml:mi><mml:mi>I</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>rs</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>3</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mrow><mml:mn>4</mml:mn><mml:mo>+</mml:mo><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:msqrt><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:msqrt><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext>r</mml:mtext></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="ueqn-26">
<mml:math id="mml-ueqn-26" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mi mathvariant="bold-italic">C</mml:mi><mml:mi mathvariant="bold-italic">I</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">G</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn mathvariant="bold">2</mml:mn><mml:mn mathvariant="bold">3</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">2</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">5</mml:mn><mml:mn mathvariant="bold">17</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:msqrt><mml:mn mathvariant="bold">17</mml:mn></mml:msqrt><mml:mo>+</mml:mo><mml:mfrac><mml:mn mathvariant="bold">2</mml:mn><mml:mn mathvariant="bold">3</mml:mn></mml:mfrac><mml:msqrt><mml:mn mathvariant="bold">3</mml:mn></mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">6</mml:mtext></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">5</mml:mtext></mml:mrow><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext mathvariant="bold">4</mml:mtext></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the results with clear upper and lower bounds (<xref ref-type="disp-formula" rid="eqn-11">Eqs. (11)</xref> &#x0026; <xref ref-type="disp-formula" rid="eqn-12">(12)</xref>) of CQI and QCI in red and blue colors respectively in the 3D version.</p>
<fig id="fig-6"><label>Figure 6</label><caption><title>CQI and QCI for regular hexagonal network</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_32271-fig-6.png"/></fig>
</sec>
</sec>
</sec>
<sec id="s6"><label>6</label><title>Conclusion</title>
<p>TIs have lots of uses and implementations in many fields of computer science, chemistry, biology, informatics, arithmetic, material sciences, and many more. But the utmost significant application is in the non-exact QSPR and QSAR. TIs are associated with the structure of mobile networks which are hexagonal layered structures called honeycombs. The study discusses the KBSO invariants and CQIs which are freshly presented and have numerous prediction qualities for different variants of hexagonal graphs or networks, i.e., honeycomb and regular hexagonal. <xref ref-type="fig" rid="fig-2">Figs. 2</xref> and <xref ref-type="fig" rid="fig-5">5</xref> give the graphical representation with sharp upper and lower bound of KBSO indices for handling high traffic load and minimal load by improving the physical layout according to deduced results. On the other hand, <xref ref-type="fig" rid="fig-3">Figs. 3</xref> and <xref ref-type="fig" rid="fig-6">6</xref> give the graphical representation of CQIs for mobile base station networks. These deduced results will be used for the node density, mobility among the nodes, link formation between the nodes, modeling and simulation of Cellular base station networks, and chemical interconnection networks.</p>
</sec>
</body>
<back>
<ack>
<p>The authors, therefore, gratefully acknowledge DSR technical and financial support.</p>
</ack>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, Saudi Arabia under Grant No. (RG&#x2212;11&#x2013;611&#x2013;43).</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Kainan</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Sinchai</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Tuwanut</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Wardkein</surname></string-name></person-group>, &#x201C;<article-title>New pulse oximetry detection based on the light absorbance ratio as determined from amplitude modulation indexes in the time and frequency domains</article-title>,&#x201D; <source>Biomedical Signal Processing and Control</source>, vol. <volume>75</volume>, no. <issue>1</issue>, pp. <fpage>103627</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Faruque</surname></string-name></person-group>, &#x201C;<chapter-title>Frequency division multiple access (FDMA)</chapter-title>,&#x201D; in <source>Radio Frequency Multiple Access Techniques Made Easy</source>, <publisher-loc>Grand Forks, GF, USA</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>21</fpage>&#x2013;<lpage>33</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Hota</surname></string-name>, <string-name><given-names>B. P.</given-names> <surname>Nayak</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>G. G. M. N.</given-names> <surname>Ali</surname></string-name> and <string-name><given-names>P. H. J.</given-names> <surname>Chong</surname></string-name></person-group>, &#x201C;<article-title>An analysis on contemporary MAC layer protocols in vehicular networks: State-of-the-art and future directions</article-title>,&#x201D; <source>Future Internet</source>, vol. <volume>13</volume>, no. <issue>11</issue>, pp. <fpage>11</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Lou</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Ahmed</surname></string-name></person-group>, <source>Link Performance Enhancement Techniques in Underwater Communications and Networks</source>, <publisher-loc>Cham, CM, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>, pp. <fpage>243</fpage>&#x2013;<lpage>267</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. C.</given-names> <surname>Meyer</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Watanabe</surname></string-name></person-group>, &#x201C;<article-title>Real-time cost minimization of fog computing in mobile-base-station networked disaster areas</article-title>,&#x201D; <source>IEEE Open Journal of the Computer Society</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>53</fpage>&#x2013;<lpage>61</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. W.</given-names> <surname>Sarwar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Riaz</surname></string-name>, <string-name><given-names>S. M. R.</given-names> <surname>Dilshad</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Al-Qahtani</surname></string-name>, <string-name><given-names>M. S.</given-names> <surname>Nawaz-Ul-Rehman</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Structure activity relationship (SAR) and quantitative structure activity relationship (QSAR) studies showed plant flavonoids as potential inhibitors of dengue NS2B-NS3 protease</article-title>,&#x201D; <source>BMC Structural. Biology</source>, vol. <volume>18</volume>, no. <issue>1</issue>, pp. <fpage>6</fpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Kulli</surname></string-name></person-group>, &#x201C;<article-title>Contraharmonic quadratic index of certain nanostar dendrimers</article-title>,&#x201D; <source>International Journal of Mathematical Archive</source>, vol. <volume>13</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Jung</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Katz</surname></string-name></person-group>, &#x201C;<article-title>Spectrum flexibility and mobile telecommunications development</article-title>,&#x201D; <source>Utilities Policy</source>, vol. <volume>75</volume>, no. <issue>1</issue>, pp. <fpage>101351</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Ni</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Jamalipour</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Federated multi-agent deep reinforcement learning for resource allocation of vehicle-to-vehicle communications</article-title>,&#x201D; <source>IEEE Transactions on Vehicular Technology</source>, vol. 1, no. 1, pp. <fpage>1</fpage>&#x2013;<lpage>10</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. D.</given-names> <surname>Gaudenzi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Luise</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Sanguinetti</surname></string-name></person-group>, &#x201C;<article-title>The open challenge of integrating satellites into (beyond-) 5G cellular networks</article-title>,&#x201D; <source>IEEE Network</source>, vol. 36, no. 2, pp. <fpage>168</fpage>&#x2013;<lpage>174</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Cai</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Virk</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Akhtar</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Maitla</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Computation of irregularity indices of certain computer networks</article-title>,&#x201D; <source>Mathematical Problems in Engineering</source>, vol. <volume>2020</volume>, no. <issue>1</issue>, pp. <fpage>2797286</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Cancan</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Ahmad</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Ahmad</surname></string-name></person-group>, &#x201C;<article-title>Study of topology of block shift networks via topological indices</article-title>,&#x201D; <source>Proyecciones (Antofagasta</source><italic>)</italic>, vol. <volume>39</volume>, no. <issue>4</issue>, pp. <fpage>887</fpage>&#x2013;<lpage>902</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Aslam</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ahmad</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Binyamin</surname></string-name> and <string-name><given-names>W.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>Calculating topological indices of certain OTIS interconnection networks</article-title>,&#x201D; <source>Open Chemistry</source>, vol. <volume>17</volume>, no. <issue>1</issue>, pp. <fpage>220</fpage>&#x2013;<lpage>228</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Imran</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>A. Q.</given-names> <surname>Baig</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Khalid</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Computing eccentricity-based topological indices of 2-power interconnection networks</article-title>,&#x201D; <source>Journal of Chemistry</source>, vol. <volume>2020</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>12</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. H.</given-names> <surname>Tang</surname></string-name></person-group>, &#x201C;<article-title>On computation of edge degree-based banhatti indices of a certain molecular network</article-title>,&#x201D; <source>Journal of Mathematics</source>, vol. <volume>2021</volume>, no. <issue>1</issue>, pp. <fpage>e5185270</fpage>, <year>2021</year> .</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Yao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Song</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ge</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Huang</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name></person-group>, &#x201C;<article-title>A Communication-aware and predictive list scheduling algorithm for network-on-chip based heterogeneous muti-processor system-on-chip,&#x201D; <italic>Microelectron</italic></article-title>. <source>Journal</source>, vol. <volume>121</volume>, no. <issue>1</issue>, pp. <fpage>105367</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B. B.</given-names> <surname>Yusuf</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Maqsood</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Rehman</surname></string-name> and <string-name><given-names>S. A.</given-names> <surname>Madani</surname></string-name></person-group>, &#x201C;<article-title>Energy aware parallel scheduling techniques for network-on-chip based systems</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, no. <issue>1</issue>, pp. <fpage>38778</fpage>&#x2013;<lpage>38791</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E. C.</given-names> <surname>Onyibo</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Safaei</surname></string-name></person-group>, &#x201C;<article-title>Application of finite element analysis to honeycomb sandwich structures: A review</article-title>,&#x201D; <source>Reports in Mechanical Engineering</source>, vol. <volume>3</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>21</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R. S.</given-names> <surname>Haoer</surname></string-name> and <string-name><given-names>A. U. R.</given-names> <surname>Virk</surname></string-name></person-group>, &#x201C;<article-title>Some reverse topological invariants for metal-organic networks</article-title>,&#x201D; <source>Journal of Discrete Mathematical Sciences and Cryptography</source>, vol. <volume>24</volume>, no. <issue>2</issue>, pp. <fpage>499</fpage>&#x2013;<lpage>510</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Afzal</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Afzal</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Farahani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Cancan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>On computation of latest topological descriptors of some cactus chains graphs via m-polynomial</article-title>,&#x201D; <source>Journal of Information and Optimization Sciences</source>, vol. <volume>42</volume>, no. <issue>7</issue>, pp. <fpage>1437</fpage>&#x2013;<lpage>1446</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Hayat</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Imran</surname></string-name></person-group>, &#x201C;<article-title>Computation of topological indices of certain networks</article-title>,&#x201D; <source>Applied Mathematics and Computation</source>, vol. <volume>240</volume>, no. <issue>1</issue>, pp. <fpage>213</fpage>&#x2013;<lpage>228</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Chaudhry</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ehsan</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Afzal</surname></string-name>, <string-name><given-names>M. R.</given-names> <surname>Farahani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Cancan</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>On computation of m-polynomial and topological indices of starphene graph</article-title>,&#x201D; <source>Journal of Discrete Mathematical Sciences and Cryptography</source>, vol. <volume>24</volume>, no. <issue>2</issue>, pp. <fpage>401</fpage>&#x2013;<lpage>414</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Afzal</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Afzal</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Cancan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ediz</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Analyzing the boron triangular nanotube through topological indices via m-polynomial</article-title>,&#x201D; <source>Journal of Discrete Mathematical Sciences and Cryptography</source>, vol. <volume>24</volume>, no. <issue>2</issue>, pp. <fpage>415</fpage>&#x2013;<lpage>426</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Chaudhry</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Farahani</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Cancan</surname></string-name>, <string-name><given-names>&#x0130;.</given-names> <surname>&#x00C7;ift&#x00E7;i</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Afzal</surname></string-name></person-group>, &#x201C;<article-title>Degree based topological indices of tadpole graph via m-polynomial</article-title> [665],&#x201D; <source>Eurasian Chemical Communications</source>, vol. <volume>3</volume>, no. <issue>1</issue>, pp. <fpage>146</fpage>&#x2013;<lpage>153</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Riaz</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Gao</surname></string-name> and <string-name><given-names>A. Q.</given-names> <surname>Baig</surname></string-name></person-group>, &#x201C;<article-title>M-Polynomials and degree-based topological indices of some families of convex polytopes</article-title>,&#x201D; <source>Open Journal of Mathematical Sciences</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>18</fpage>&#x2013;<lpage>28</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Bordoloi</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Kalita</surname></string-name></person-group>, &#x201C;<article-title>Designing graph database models from existing relational databases</article-title>,&#x201D; <source>International Journal of Computer Applications</source>, vol. <volume>74</volume>, no. <issue>1</issue>, pp. <fpage>25</fpage>&#x2013;<lpage>31</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Khalid</surname></string-name>, <string-name><given-names>M. W.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>A. U. R.</given-names> <surname>Virk</surname></string-name>, <string-name><given-names>M. U.</given-names> <surname>Ashraf</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Alghamdi</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>K-banhatti sombor invariants of certain computer networks,&#x201D; <italic>Computer</italic></article-title>,&#x201D; <source>Materials and Continua</source>, vol. <volume>73</volume>, no. <issue>1</issue>, pp. <fpage>15</fpage>&#x2013;<lpage>31</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Virk</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Bilal</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Hamid</surname></string-name></person-group>, &#x201C;<article-title>Irregularity invariants for chemical structures used in the treatment of COVID-19</article-title>,&#x201D; <source>Scientific Inquiry and Review</source>, vol. <volume>4</volume>, no. <issue>3</issue>, pp. <fpage>38</fpage>&#x2013;<lpage>60</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Hamid</surname></string-name>, <string-name><given-names>M. W.</given-names> <surname>Iqbal</surname></string-name>, <string-name><given-names>H. A. B.</given-names> <surname>Muhammad</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Fuzail</surname></string-name>, <string-name><given-names>Z. T.</given-names> <surname>Ghafoor</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Usability evaluation of mobile banking applications in digital business as emerging economy</article-title>,&#x201D; <source>International Journal of Computer Science and Network Security</source>, vol. <volume>22</volume>, no. <issue>2</issue>, pp. <fpage>250</fpage>&#x2013;<lpage>271</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Yasin</surname></string-name>, <string-name><given-names>S. F.</given-names> <surname>Abbas</surname></string-name> and <string-name><given-names>M. W.</given-names> <surname>Iqbal</surname></string-name></person-group>, &#x201C;<article-title>Carbon emission-aware routing protocol in vehicular ad-hoc networks</article-title>,&#x201D; in <conf-name>9th Int. Conf. on Application of Information and Communication Technologies (AICT)</conf-name>, <conf-loc>Rostov-on-Don, Russia</conf-loc>, pp. <fpage>461</fpage>&#x2013;<lpage>466</lpage>, <year>2015</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>