Skip to main content
Heliyon logoLink to Heliyon
. 2023 Jun 14;9(6):e17122. doi: 10.1016/j.heliyon.2023.e17122

Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters

Ali NA Koam a, Ali Ahmad b, Muhammad Azeem c,, Khalil Hadi Hakami a, Kashif Elahi d
PMCID: PMC10285186  PMID: 37360097

Abstract

The eigenvalues are significant in mathematics, but they are also relevant in other domains like as chemistry, economics, and a variety of others. In terms of our research, eigenvalues are used in chemistry to represent not only the form of energy but also the various physicochemical aspects of a chemical substance. We must comprehend the connection between mathematics and chemistry. The antibonding level is related to positive eigenvalues, the bonding level is associated to negative eigenvalues, and the nonbonding level is linked to zero eigenvalues. In this work, we studied some anticancer drug structures in terms of nullity, matching number, eigenvalues of adjacency matrix, and characteristics polynomials. As a result, Carmustine, Caulibugulone-E, Aspidostomide-E anticancer drug structures are stable, closed-shell molecules since their nullity is equal to zero.

MSC: 05C10, 05C50, 05C70, 05C90, 15A18, 15A90, 74E40, 74F25

Keywords: Nullity, Matching number, Energy, Inertia, Characteristics polynomials, Eigenvalues, First Betti number, Cyclomatic number, Anticancer drugs

1. Introduction

The rapid proliferation of aberrant cells in the human body is known as cancer. Cancer-causing compounds are known as carcinogens. A carcinogen is a chemical compound found in cigarette smoke that contains certain components. It has the ability to spread throughout the body. A lump, abnormal bleeding, a prolonged cough, and weight loss are some of the symptoms of this condition. Chewing tobacco, obesity, a poor diet, laziness, and excessive alcohol consumption are the main causes of this cancerous condition. Several treatments, including surgery, radiotherapy, chemotherapy, hormone therapy, targeted therapy, and others, can be used to treat this severe disease. Anticancer medicines, which include alkylates and metabolites, are used to treat the disease known as cancer [1], [2], [3], [4].

Chemical graph theory is a branch of mathematics chemistry concerned with chemical graphs that depict chemical systems. The chemical graph theory allows for the definition of numerous anticancer medication properties [5], [6]. Several medicational structures are used in this study, by measuring nullity, matching number, eigenvalues of adjacency matrix, and characteristics polynomials.

Nullity is an important factor in molecule stability, and if nullity is zero, the molecule is projected to have a stable, closed-shell electron configuration. The molecule is unstable, extremely reactive, nonexistent, and open shell if nullity is larger than zero [7]. As a result, some of the chosen anticancer drug structures are stable, closed-shell molecules since their nullity is equal to zero.

There are numerous research work is available on the nullity, matching number, eigenvalues of adjacency matrix, characteristics polynomials. Only recent and few important articles are given herewith their importance. A proof is given on the conjecture on the topic of nullity [8]. Rank four graphs are characterized in [9], rank five in [10]. For upper bounds on the nullity n2 and n3, see [11], while further generalizations are given in [12]. For a relation between matching number and rank of a graph given in [13]. Trees are discussed in terms of nullity of a graph found in [14]. On the nullity of a graph with cut-points [15]. Unicyclic graphs in terms of nullity and matching number are found in [16], while for bicyclci graphs are herein [17] and for the line operation of unicyclic graphs and their nullity in [18]. Pure mathematical and abstract theory on nullity is available in [19], [20], [21]. Nullity is expressed in terms of maximum degree of a vertex [22], [23]. Authors of [24], [25], computed the double metric resolvability of convex polytopes, authors of [26], computed the edge version of resolvability and double resolvability of some generalized graphs.

The chemical complex is typically depicted as a graph, with the elements representing vertices and the bonds linking them representing edges. Similarly, the anticancer medications under investigation are treated as chemical compounds, and the parameters are investigated [27]. Graph theory provides methods such as QSAR, QSPR, and QSTR (quantitative structure-activity/property/toxicity relationship) that chemists and pharmacists can employ to enhance their research. Drugs are represented as molecular networks in theoretical chemistry, with each vertex representing an atom and each edge representing a relationship between two atoms [28], [29]. Assume that G(V,E) is a molecular graph with vertex and edge sets. Simple graphs with no cycle creation and several edges are considered, while |V(G)|=n and |E(G)|=m are order and size of a graph G, respectively. Adjacency matrix is defined by the elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph and it is denoted by A(G). Characteristics polynomial of a graph is defined by Char(A(G);λ)=det(A(G)λI)=0, where I is an identity matrix of order same as A-matrix. The values of parameter λ in the equation det(A(G)λI)=0 are known as eigenvalues and we symbolized as Eig(Char(A(G);λ)). While the mulitplicity of Eig(Char(A(G);λ))=0 is known as nullity of a graph G, and usually it is denoted by η(G) [30]. In [31], the nullity of a bipartite graph is defined by

η(G)=n2M(G). (1)

In the Equation (1), a parameter M(G) is known as matching number and defined by the size of a largest maximal independent edge set [32], [33]. In Fig. 1 to Fig. 10, the wavy edges denoted that edges contributed towards the count of matching number for all anticancer drug structures.

Figure 1.

Figure 1

Anticancer drug structure Amathas-Piramide-E.

Figure 10.

Figure 10

Anticancer drug structure Tambjamine-K.

The positive inertia index is represented by the number of positive eigenvalues p(G), whereas the negative inertia index is represented by the number of negative eigenvalues q(G). An energy of the graph G is the absolute sum of all the eigenvalues. It is written as E=i=1k=|λi| in mathematics [7], [34].

2. Results on matching number and nullity of anticancer drug structures

Several medicational structures are used in this study, by measuring nullity, matching number, eigenvalues of adjacency matrix, and characteristics polynomials.

2.1. Results of matching number and nullity of Amathas-Piramide-E anticancer drug structure

The order of graph obtained from Amathas-Piramide-E |V(G1)|=22, while the size is counted in |E(G1)|=24. Moreover, the vertex and edge set is defined by

V(G1)={vi:1i22},E(G1)={vivj:i,j=1,2,,7}{vivj:i,j=8,9,,15}{v14v15,v11v16,v8v16,v6v12,v5v19,v12v20,v14v21,v15v22,v1v17,v3v18}

Lemma 2.1

Let G1 be a graph obtained by an anticancer drug structure Amathas-Piramide-E. Then η(G1)=1 .

Proof

Observe that G1 is the graph of Amathas-Piramide-E an anticancer drug structure developed by some pendant vertices, two pentagons, and a single hexagon. Fig. 1, shows that it is not a bipartite graph. So to compute the nullity of G1, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G1);λ) of the adjacency matrix A(G1) of graph G1, characteristics polynomial is described as;

Char(A(G1);λ)=λ2223λ20+220λ182λ171146λ16+32λ15+3577λ14200λ136932λ12+632λ11+8353λ101092λ96088λ8+1040λ7+2513λ6518λ5507λ4+114λ3+33λ26λ.

Now, by solving Char(A(G1);λ)=0 for λ, the eigenvalues Eig(Char(A(G1);λ)) of determined polynomials are

Eig(Char(A(G1);λ))={0,2.4727,2.1834,1.7631,1.6180,1.6063,1.3109,0.9348,0.8836,0.7166,0.3071,0.1585,0.5259,0.6180,0.7480,0.9260,1.2615,1.3524,1.6064,1.8599,2.2338,2.5061}.

Observing that there is only a single value of Eig(Char(A(G1);λ))=0 and which is concluding that η(G1)=1.

Furthermore, the Fig. 1, it is showing that there are ten counts of wavy edges and which is the matching number M(G1) of graph G1. □

2.2. Results of matching number and nullity of Carmustine anticancer drug structure

The order of graph obtained from Carmustine |V(G2)|=12, while the size is counted in |E(G2)|=11. Moreover, the vertex and edge set is defined by

V(G2)={vi:1i12},E(G2)={vivj:i,j=1,2,,9}{v5v12,v4v10,v10v11}

Lemma 2.2

LetG2be a graph obtained by an anticancer drug structure Carmustine. Thenη(G2)=0.

Proof

Observe that G2 is the graph of Carmustine an anticancer drug structure developed by some pendant vertices, without any cycle. Fig. 2, shows that it is a bipartite graph. So to compute the nullity of G2, we will follow the Equation (1). Fig. 1, it is showing that there is six-count of wavy edges and which is the matching number M(G2) of graph G2. So by applying the definition of the nullity of a bipartite graph η(G2)=n2M=122(6)=0.

Furthermore, by using the definition of nullity, we will determine the characteristics polynomial Char(A(G2);λ) of the adjacency matrix A(G2) of graph G2, characteristics polynomial is described as;

Char(A(G2);λ)=λ1211λ10+43λ874λ6+55λ414λ2+1.

Now, by solving Char(A(G2);λ)=0 for λ, the eigenvalues Eig(Char(A(G2);λ)) of determined polynomials are

Eig(Char(A(G1);λ))={2.1673,1.6783,1.3427,1.1358,0.5246,0.3436,0.3436,0.5246,1.1358,1.3427,1.6783,2.1673}.

Observing that there is no value of Eig(Char(A(G2);λ))=0 and which is concluding that η(G2)=0. □

Figure 2.

Figure 2

Anticancer drug structure Carmustine.

2.3. Results of matching number and nullity of Caulibugulone-E anticancer drug structure

The order of graph obtained from Caulibugulone-E |V(G3)|=14, while the size is counted in |E(G3)|=15. Moreover, the vertex and edge set is defined by

V(G3)={vi:1i14},E(G3)={vivj:i,j=1,2,,12}{v4v14,v3v12,v5v10,v11v13}

Lemma 2.3

Let G3 be a graph obtained by an anticancer drug structure Caulibugulone-E. Then η(G3)=0 .

Proof

Observe that G3 is the graph of Caulibugulone-E an anticancer drug structure developed by some pendant vertices, two cycles of length eight. Fig. 3, shows that it is a bipartite graph. So to compute the nullity of G3, we will follow the Equation (1). Fig. 3, it is showing that there is seven-count of wavy edges and which is the matching number M(G3) of graph G3. So by applying the definition of the nullity of a bipartite graph η(G3)=n2M=142(7)=0.

Furthermore, by using the definition of nullity, we will determine the characteristics polynomial Char(A(G3);λ) of the adjacency matrix A(G3) of graph G3, characteristics polynomial is described as;

Char(A(G3);λ)=λ1415λ12+84λ10225λ8+304λ6200λ4+56λ24.

Now, by solving Char(A(G3);λ)=0 for λ, the eigenvalues Eig(Char(A(G3);λ)) of determined polynomials are

Eig(Char(A(G3);λ))={2.4344,1.8478,1.6055,1.2736,0.8769,0.7654,0.3240,0.3240,0.7654,0.8769,1.2736,1.6055,1.8478,2.4344}.

Observing that there is no value of Eig(Char(A(G3);λ))=0 and which is concluding that η(G3)=0. □

Figure 3.

Figure 3

Anticancer drug structure Caulibugulone-E.

2.4. Results of matching number and nullity of Aspidostomide-E anticancer drug structure

The order of graph obtained from Aspidostomide-E |V(G4)|=26, while the size is counted in |E(G4)|=29. Moreover, the vertex and edge set is defined by

V(G4)={vi:1i26},E(G4)={vivj:i,j=1,2,,11}{vivj:i,j=12,13,,20}{v3v11,v2v3,v1v2,v5v22,v6v10,v7v23,v8v24,v9v25,v11v15,v12v21,v12v20,v14v18,v16v26}

Lemma 2.4

Let G4 be a graph obtained by an anticancer drug structure Aspidostomide-E. Then η(G4)=0 .

Proof

Observe that G4 is the graph of Aspidostomide-E an anticancer drug structure developed by some pendant vertices, two pentagons the same count of hexagons. Fig. 4, shows that it is not a bipartite graph. So to compute the nullity of G4, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G4);λ) of the adjacency matrix A(G4) of graph G4, characteristics polynomial is described as;

Char(A(G4);λ)=λ2629λ24+361λ224λ212536λ20+78λ19+11121λ18618λ1731803λ16+2588λ15+60177λ146230λ1374914λ12+8780λ11+59908λ107076λ929435λ8+3058λ7+8260λ6628λ51177λ4+50λ3+69λ21.

Now, by solving Char(A(G4);λ)=0 for λ, the eigenvalues Eig(Char(A(G4);λ)) of determined polynomials are

Eig(Char(A(G4);λ))={2.4787,2.2370,2.1237,1.9502,1.7048,1.5638,1.3400,1.0401,0.8788,0.5584,0.5177,0.2512,0.1650,0.1340,0.3667,0.4500,0.7540,1.0000,1.1111,1.2313,1.3402,1.6019,1.8261,1.9975,2.3929,2.6038}.

Observing that there is no value of Eig(Char(A(G4);λ))=0 and which is concluding that η(G4)=0.

Furthermore, the Fig. 4, it is showing that there are 13 counts of wavy edges and which is the matching number M(G4) of graph G4. □

Figure 4.

Figure 4

Anticancer drug structure Aspidostomide-E.

2.5. Results of matching number and nullity of Convolutamide-A anticancer drug structure

The order of graph obtained from Convolutamide-A |V(G5)|=31, while the size is counted in |E(G5)|=32. Moreover, the vertex and edge set is defined by

V(G5)={vi:1i31},E(G5)={vivj:i,j=1,2,,6}{vivj:i,j=7,8,,11}{vivj:i,j=12,13,,25}{v1v30,v1v6,v6v29,v5v28,v3v11,v11v27,v10v26,v7v11,v9v12,v12v31}

Lemma 2.5

Let G5 be a graph obtained by an anticancer drug structure Convolutamide-A. Then η(G5)=3 .

Proof

Observe that G5 is the graph of Convolutamide-A an anticancer drug structure developed by some pendant vertices, 1 pentagon, and a single hexagon. Fig. 5, shows that it is not a bipartite graph. So to compute the nullity of G5, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G5);λ) of the adjacency matrix A(G5) of graph G5, characteristics polynomial is described as;

Char(A(G5);λ)=λ3132λ29+453λ272λ263749λ25+46λ24+20191λ23456λ2274531λ21+2560λ20+193407λ198988λ18356043λ17+20548λ16+463363λ1530848λ14419835λ13+29904λ12+257357λ1117904λ10101942λ9+6096λ8+24282λ71024λ63074λ5+64λ4+156λ3.

Now, by solving Char(A(G5);λ)=0 for λ, the eigenvalues Eig(Char(A(G5);λ)) of determined polynomials are

Eig(Char(A(G5);λ))={0,0,0,2.4356,2.1859,2.0217,1.9405,1.7932,1.5856,1.4142,1.3550,1.2082,1.0995,0.7777,0.5774,0.4289,0.3963,0.3925,0.4613,0.7137,0.8663,1.0000,1.1379,1.3320,1.4142,1.5357,1.7466,1.8915,1.9701,2.2327,2.5248}.

Observing that there are three count of Eig(Char(A(G1);λ))=0 and which is concluding that η(G5)=3.

Furthermore, the Fig. 5, it is showing that there are fourteen counts of wavy edges and which is the matching number M(G5) of graph G5. □

Figure 5.

Figure 5

Anticancer drug structure Convolutamide-A.

2.6. Results of matching number and nullity of Convolutamine-F anticancer drug structure

The order of graph obtained from Convolutamine-F |V(G6)|=15, while the size is counted in |E(G6)|=15. Moreover, the vertex and edge set is defined by

V(G6)={vi:1i15},E(G6)={vivj:i,j=1,2,,6}{vivj:i,j=7,8,,10}{v1v12,v2v14,v13v14,v3v15,v4v7,v5v11,v1v6,v3v4}

Lemma 2.6

Let G6 be a graph obtained by an anticancer drug structure Convolutamine-F. Then η(G6)=3 .

Proof

Observe that G3 is the graph of Convolutamine-F an anticancer drug structure developed by some pendant vertices, single cycle of length eight. Fig. 6, shows that it is a bipartite graph. So to compute the nullity of G6, we will follow the Equation (1). Fig. 6, it is showing that there is six-count of wavy edges and which is the matching number M(G6) of graph G6. So by applying the definition of the nullity of a bipartite graph η(G6)=n2M=152(6)=3.

Furthermore, by using the definition of nullity, we will determine the characteristics polynomial Char(A(G6);λ) of the adjacency matrix A(G6) of graph G6, characteristics polynomial is described as;

Char(A(G6);λ)=λ1515λ13+85λ11233λ9+323λ7211λ5+50λ3.

Now, by solving Char(A(G6);λ)=0 for λ, the eigenvalues Eig(Char(A(G6);λ)) of determined polynomials are

Eig(Char(A(G6);λ))={0,0,0,2.3991,1.8061,1.5606,1.4142,1.0000,0.7394,0.7394,1.0000,1.4142,1.5606,1.8061,2.3991}.

Observing that there are three values of Eig(Char(A(G2);λ))=0 and which is concluding that η(G6)=3. □

Figure 6.

Figure 6

Anticancer drug structure Convolutamine-F.

2.7. Results of matching number and nullity of Convolutamydine-A anticancer drug structure

The order of graph obtained from Convolutamydine-A |V(G7)|=16, while the size is counted in |E(G7)|=18. Moreover, the vertex and edge set is defined by

V(G7)={vi:1i16},E(G7)={vivj:i,j=1,2,,12}{v2v14,v4v15,v6v16,v12v13,v3v10,v4v8,v1v12}

Lemma 2.7

Let G7 be a graph obtained by an anticancer drug structure Convolutamydine-A. Then η(G7)=4 .

Proof

Observe that G7 is the graph of Convolutamydine-A an anticancer drug structure developed by some pendant vertices, two pentagons, and a single hexagon. Fig. 7, shows that it is not a bipartite graph. So to compute the nullity of G7, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G7);λ) of the adjacency matrix A(G7) of graph G7, characteristics polynomial is described as;

Char(A(G7);λ)=λ1618λ14+124λ124λ11415λ10+34λ9+700λ890λ7542λ6+76λ5+133λ4.

Now, by solving Char(A(G7);λ)=0 for λ, the eigenvalues Eig(Char(A(G7);λ)) of determined polynomials are

Eig(Char(A(G7);λ))={0,0,0,0,2.3958,2.1148,1.8930,1.4927,1.3535,0.5272,0.9296,1.1075,1.4992,1.5584,2.0790,2.6033}.

Observing that there are four counts of the values of Eig(Char(A(G1);λ))=0 and which is concluding that η(G7)=4.

Furthermore, the Fig. 7, it is showing that there are six counts of wavy edges and which is the matching number M(G7) of graph G7. □

Figure 7.

Figure 7

Anticancer drug structure Convolutamydine-A.

2.8. Results of matching number and nullity of Perfragilin-A anticancer drug structure

The order of graph obtained from Perfragilin-A |V(G8)|=17, while the size is counted in |E(G8)|=18. Moreover, the vertex and edge set is defined by

V(G8)={vi:1i17},E(G8)={vivj:i,j=1,2,,13}{v1v11,v11v12,v5v6,v2v13,v5v14,v6v15,v9v16,v10v17,v1v10,v3v8}

Lemma 2.8

Let G8 be a graph obtained by an anticancer drug structure Perfragilin-A. Then η(G8)=1 .

Proof

Observe that G8 is the graph of Perfragilin-A an anticancer drug structure developed by some pendant vertices, two cycles of length eight. Fig. 8, shows that it is a bipartite graph. So to compute the nullity of G8, we will follow the Equation (1). Fig. 8, it is showing that there is eight-count of wavy edges and which is the matching number M(G8) of graph G8. So by applying the definition of the nullity of a bipartite graph η(G8)=n2M=172(8)=1.

Furthermore, by using the definition of nullity, we will determine the characteristics polynomial Char(A(G8);λ) of the adjacency matrix A(G8) of graph G8, characteristics polynomial is described as;

Char(A(G8);λ)=λ1718λ15+126λ13442λ11+833λ9836λ7+413λ582λ3+4λ.

Now, by solving Char(A(G8);λ)=0 for λ, the eigenvalues Eig(Char(A(G8);λ)) of determined polynomials are

Eig(Char(A(G8);λ))={0,2.4978,2.0576,1.6713,1.4839,1.1368,0.9232,0.5633,0.2654,0.2654,0.5633,0.9232,1.1368,1.4839,1.6713,2.0576,2.4978}.

Observing that there is a single value of Eig(Char(A(G8);λ))=0 and which is concluding that η(G8)=1. □

Figure 8.

Figure 8

Anticancer drug structure Perfragilin-A.

2.9. Results of matching number and nullity of Melatonin anticancer drug structure

The order of graph obtained from Melatonin |V(G9)|=17, while the size is counted in |E(G9)|=18. Moreover, the vertex and edge set is defined by

V(G9)={vi:1i17},E(G9)={vivj:i,j=1,2,,9}{vivj:i,j=10,11,,14}{v13v15,v4v8,v2v16,v16v17}

Lemma 2.9

Let G9 be a graph obtained by an anticancer drug structure Melatonin. Then η(G9)=1 .

Proof

Observe that G9 is the graph of Melatonin an anticancer drug structure developed by some pendant vertices, a single pentagon, and a single hexagon. Fig. 9, shows that it is not a bipartite graph. So to compute the nullity of G9, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G9);λ) of the adjacency matrix A(G9) of graph G1, characteristics polynomial is described as;

Char(A(G9);λ)=λ1718λ15+129λ132λ12474λ11+20λ10+957λ972λ81057λ7+114λ6+598λ580λ4144λ3+20λ2+8λ.

Now, by solving Char(A(G9);λ)=0 for λ, the eigenvalues Eig(Char(A(G9);λ)) of determined polynomials are

Eig(Char(A(G9);λ))={0,2.2999,2.0000,1.7964,1.6653,1.1300,1.0000,0.7151,0.1949,0.4233,0.6396,1.0000,1.0888,1.4530,1.8199,1.9558,2.4211}.

Observing that there is only a single value of Eig(Char(A(G9);λ))=0 and which is concluding that η(G9)=1.

Furthermore, the Fig. 9, it is showing that there are eight counts of wavy edges and which is the matching number M(G9) of graph G9. □

Figure 9.

Figure 9

Anticancer drug structure Melatonin.

2.10. Results of matching number and nullity of Tambjamine-K anticancer drug structure

The order of graph obtained from Tambjamine-K |V(G10)|=19, while the size is counted in |E(G10)|=20. Moreover, the vertex and edge set is defined by

V(G10)={vi:1i19},E(G10)={vivj:i,j=1,2,,5}{vivj:i,j=6,7,,10}{vivj:i,j=11,12,,16}{v3v6,v8v18,v18v19,v9v11,v15v17}

Lemma 2.10

Let G10 be a graph obtained by an anticancer drug structure Tambjamine-K. Then η(G10)=1 .

Proof

Observe that G10 is the graph of Tambjamine-K an anticancer drug structure developed by some pendant vertices, and two pentagons. Fig. 10, shows that it is not a bipartite graph. So to compute the nullity of G10, we can not follow the Equation (1). Therefore, using the definition of nullity, we will determine the characteristics polynomial Char(A(G10);λ) of the adjacency matrix A(G10) of graph G10, characteristics polynomial is described as;

Char(A(G10);λ)=λ1920λ17+164λ154λ14714λ13+52λ12+1785λ11258λ102581λ9+612λ8+2045λ7710λ6755λ5+360λ4+71λ354λ2+6λ.

Now, by solving Char(A(G10);λ)=0 for λ, the eigenvalues Eig(Char(A(G10);λ)) of determined polynomials are

Eig(Char(A(G10);λ))={0,2.1363,2.1225,1.9049,1.6180,1.5051,1.2730,0.9461,0.4990,0.1673,0.4002,0.6012,0.6180,1.0000,1.3453,1.4991,1.9169,2.0555,2.4014}.

Observing that there is only a single value of Eig(Char(A(G10);λ))=0 and which is concluding that η(G10)=1.

Furthermore, the Fig. 10, it is showing that there are eight counts of wavy edges and which is the matching number M(G10) of graph G10. □

3. Conclusion and discussion

Some anticancer drug structures are studied namely, Amathas-Piramide-E, Carmustine, Caulibugulone-E, Aspidostomide-E, Convolutamide-A, Convolutamine-F, Convolutamydine-A, Perfragilin-A, Melatonin, and Tambjamine-K. All these structures are studied in terms of nullity, matching number, eigenvalues of adjacency matrix, and characteristics polynomials. As a result, Carmustine, Caulibugulone-E, Aspidostomide-E anticancer drug structures are stable, closed-shell molecules since their nullity is equal to zero (Table 1).

Table 1.

Energy, positive-negative-Inertia and nullity for various anticancer drug structures.

G η(G) p(G) q(G) E
G1 1 11 10 27.5929
G2 0 12 6 14.3847
G3 0 7 7 18.2550
G4 0 13 13 33.6189
G5 3 14 14 38.4390
G6 3 6 6 17.8389
G7 4 6 6 19.5540
G8 1 8 8 21.1985
G9 1 8 8 21.6032
G10 1 10 8 24.0097

The first Betti number b1(G)=m+|C|n. It is also called the cyclomatic number a term introduced by [35]. While in [36], nullity termed referred as first Betti number or cyclomatic number (cn(G)). Table 2, compare nullity, first Betti number and cyclomatic number for anticancer drug structures.

Table 2.

Different parameters for various anticancer drug structures.

G η(G) b1(G) cn(G)
G1 1 3 3
G2 0 0 0
G3 0 2 2
G4 0 4 4
G5 3 2 2
G6 3 1 1
G7 4 3 3
G8 1 2 2
G9 1 2 2
G10 1 2 2

From the comparison given in the Table 2, the first betti number and nullity is equal for G2, otherwise all the anticancer drug structures have different nullity and first Betti number, somehow the count of cyclomatic number and first Betti number are same for all the structures. Moreover, further research direction can be considered for the structures of [37], in the context to this chosen topic.

CRediT authorship contribution statement

Ali. N. A. Koam, A. Ahmad, M. Azeem, Khalil Hadi Hakami, and Kashif Elahi: conceived and designed the experiments; performed the experiments; analyzed and interpreted the data; contributed reagents, materials, analysis tools or data; wrote the paper.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgement

The authors extend their appreciation to the Deputyship for Research and Innovation, Ministry of Education in Saudi Arabia for funding this research work through the project number ISP22-6.

Contributor Information

Ali N.A. Koam, Email: akoum@jazanu.edu.sa.

Ali Ahmad, Email: aimam@jazanu.edu.sa, ahmadsms@gmail.com.

Muhammad Azeem, Email: azeemali7009@gmail.com.

Khalil Hadi Hakami, Email: khakami@jazanu.edu.sa.

Kashif Elahi, Email: kelahi@jazanu.edu.sa.

Data availability

Data included in article/supplementary material/referenced in article.

References

  • 1.Shanmukha M., Basavarajappa N., Shilpa K., Usha A. Degree-based topological indices on anticancer drugs with qspr analysis. Heliyon. jun 2020;6(6) doi: 10.1016/j.heliyon.2020.e04235. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 2.Figuerola B., Avila C. The phylum bryozoa as a promising source of anticancer drugs. Mar. Drugs. aug 2019;17(8):477. doi: 10.3390/md17080477. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 3.Gao W., Wang W., Farahani M.R. Topological indices study of molecular structure in anticancer drugs. J. Chem. 2016;2016:1–8. [Google Scholar]
  • 4.Kumar S. Drug targets for cancer treatment: an overview. Med. Chem. 2015;5(3) [Google Scholar]
  • 5.Alshehri H., Ahmad A., Alqahtani Y., Azeem M. Vertex metric-based dimension of generalized perimantanes diamondoid structure. IEEE Access. 2022;10:320–43 326. [Google Scholar]
  • 6.Koam A.N., Ahmad A., Azeem M., Nadeem M.F. Bounds on the partition dimension of one pentagonal carbon nanocone structure. Arab. J. Chem. jul 2022;15(7) [Google Scholar]
  • 7.Ahmad Z., Mufti Z.S., Nadeem M.F., Shaker H., Siddiqui H.M.A. Theoretical study of energy, inertia and nullity of phenylene and anthracene. Open Chem. jan 2021;19(1):541–547. [Google Scholar]
  • 8.Wang L., Geng X. Proof of a conjecture on the nullity of a graph. J. Graph Theory. may 2020;95(4):586–593. [Google Scholar]
  • 9.Chang G.J., Huang L.-H., Yeh H.-G. A characterization of graphs with rank 4. Linear Algebra Appl. apr 2011;434(8):1793–1798. [Google Scholar]
  • 10.Chang G.J., Huang L.-H., Yeh H.-G. A characterization of graphs with rank 5. Linear Algebra Appl. jun 2012;436(11):4241–4250. [Google Scholar]
  • 11.Cheng B., Liu B. On the nullity of graphs. Electron. J. Linear Algebra. jan 2007;16 [Google Scholar]
  • 12.Song Y. zhi, Song X. qiu, Tam B.-S. A characterization of graphs g with nullity. Linear Algebra Appl. jan 2015;465:363–375. [Google Scholar]
  • 13.Chen C., Huang J., Li S. On the relation between the h-rank of a mixed graph and the matching number of its underlying graph. Linear Multilinear Algebra. sep 2017;66(9):1853–1869. [Google Scholar]
  • 14.Fiorini S., Gutman I., Sciriha I. Trees with maximum nullity. Linear Algebra Appl. mar 2005;397:245–251. [Google Scholar]
  • 15.Gong S.-C., Xu G.-H. On the nullity of a graph with cut-points. Linear Algebra Appl. jan 2012;436(1):135–142. doi: 10.1016/j.laa.2011.06.039. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16.Guo J.-M., Yan W., Yeh Y.-N. On the nullity and the matching number of unicyclic graphs. Linear Algebra Appl. sep 2009;431(8):1293–1301. [Google Scholar]
  • 17.Hu S., Xuezhong T., Liu B. On the nullity of bicyclic graphs. Linear Algebra Appl. oct 2008;429(7):1387–1391. [Google Scholar]
  • 18.Li H.-H., Fan Y.-Z., Su L. On the nullity of the line graph of unicyclic graph with depth one. Linear Algebra Appl. oct 2012;437(8):2038–2055. [Google Scholar]
  • 19.Ma X., Wong D., Tian F. Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices. Discrete Appl. Math. dec 2016;215:171–176. [Google Scholar]
  • 20.Skew-Rank of an Oriented Graph in Terms of Matching NumberLinear Algebra Appl. apr 2016;495:242–255. [Google Scholar]
  • 21.Yu G., Qu H., Tu J. Inertia of complex unit gain graphs. Appl. Math. Comput. aug 2015;265:619–629. [Google Scholar]
  • 22.Song Y. zhi, Song X. qiu, Zhang M. An upper bound for the nullity of a bipartite graph in terms of its maximum degree. Linear Multilinear Algebra. aug 2015;64(6):1107–1112. [Google Scholar]
  • 23.Zhou Q., Wong D., Sun D. An upper bound of the nullity of a graph in terms of order and maximum degree. Linear Algebra Appl. oct 2018;555:314–320. [Google Scholar]
  • 24.Ahmad M., Alrowaili D., Ali R., Zahid Z., Siddique I. Double metric resolvability in convex polytopes. J. Math. jul 2022;2022:1–10. [Google Scholar]
  • 25.Ahmad M., Zahid Z., Javaid M., Bonyah E. Studies of chordal ring networks via double metric dimensions. Math. Probl. Eng. aug 2022;2022:1–7. [Google Scholar]
  • 26.Ahmad M., Zahid Z., Rashid T., Guirao J.L.G. Computing edge version of resolvability and double resolvability of a graph. J. Chem. feb 2022;2022:1–11. [Google Scholar]
  • 27.Azeem M., Nadeem M.F. Metric-based resolvability of polycyclic aromatic hydrocarbons. Eur. Phys. J. Plus. apr 2021;136(4) [Google Scholar]
  • 28.Raza H., Waheed M., Jamil M.K., Azeem M. Structures devised by the generalizations of two graph operations and their topological descriptors. Main Group Met. Chem. jan 2022;45(1):44–56. [Google Scholar]
  • 29.Ahmad A.-N.A.-H., Ahmad A., Azeem M. Computation of edge- and vertex-degree-based topological indices for tetrahedral sheets of clay minerals. Main Group Met. Chem. jan 2022;45(1):26–34. [Google Scholar]
  • 30.Ghorbani M., Songhori M. Distance, Symmetry, and Topology in Carbon Nanomaterials. Springer International Publishing; 2016. Nullity of graphs; pp. 317–343. [Google Scholar]
  • 31.Omidi G.R. On the nullity of bipartite graphs. Graphs Comb. may 2009;25(1):111–114. [Google Scholar]
  • 32.Wang L., Wong D. Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. Discrete Appl. Math. mar 2014;166:276–281. [Google Scholar]
  • 33.Wang L. Characterization of graphs with given order, given size and given matching number that minimize nullity. Discrete Math. may 2016;339(5):1574–1582. [Google Scholar]
  • 34.Azeem M., Jamil M.K., Shang Y. Notes on the localization of generalized hexagonal cellular networks. Mathematics. feb 2023;11(4):844. [Google Scholar]
  • 35.Kotiuga P.R. A celebration of the mathematical legacy of Raoul Bott. Am. Math. Soc. 2010 [Google Scholar]
  • 36.Elshoff J.L., Marcotty M. On the use of the cyclomatic number to measure program complexity. ACM SIGPLAN Not. dec 1978;13(12):29–40. [Google Scholar]
  • 37.Huang Q., Khalil A., Ali D.A., Ahmad A., Luo R., Azeem M. Breast cancer chemical structures and their partition resolvability. Math. Biosci. Eng. 2022;20(2):3838–3853. doi: 10.3934/mbe.2023180. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Data included in article/supplementary material/referenced in article.


Articles from Heliyon are provided here courtesy of Elsevier

RESOURCES