Results 11 to 20 of about 6,957 (218)
Metric Dimensions of Bicyclic Graphs
The distance d(va,vb) between two vertices of a simple connected graph G is the length of the shortest path between va and vb. Vertices va,vb of G are considered to be resolved by a vertex v if d(va,v)≠d(vb,v).
Asad Khan +5 more
doaj +2 more sources
Maximum Estrada Index of Bicyclic Graphs
Let $G$ be a simple graph of order $n$, let $\lambda_1(G),\lambda_2(G),...,\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\sum_{i=1}^{n}e^{\lambda_i(G)}$.
Cvetkovíc +20 more
core +3 more sources
The Maximal Total Irregularity of Bicyclic Graphs [PDF]
In 2012, Abdo and Dimitrov defined the total irregularity of a graph G=(V,E) as irrtG=1/2∑u,v∈VdGu-dGv, where dGu denotes the vertex degree of a vertex u∈V.
Lihua You +3 more
doaj +3 more sources
Maximal elliptic Sombor index of bicyclic graphs [PDF]
Fuxian Qi, Zhen Lin
doaj +3 more sources
End-regularity of generalized bicycle graph [PDF]
A graph G is called End-regular, if every endomorphism of G is regular as a monoid. In this article, we investigate End-regularity of bicycle graphs. Moreover, a generalization of bicycle graph is defined and gives a characterization of End-regular generalized bicycle graphs.
Asieh Ghorbanian Rajabi +2 more
openalex +3 more sources
The inertia of unicyclic graphs and bicyclic graphs
Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G).
Ying Liu
openalex +2 more sources
ARITHMETICAL RANK OF THE CYCLIC AND BICYCLIC GRAPHS [PDF]
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex, the arithmetical rank equals the projective dimension of the corresponding quotient ring.
Margherita Barile +3 more
openalex +6 more sources
Bicyclic graphs with extremal degree resistance distance [PDF]
Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$ with a unit resistor. The degree resistance distance of a simple graph $G$ is defined as ${D_R}(G) = \sum\limits_{\{u,
Jia Liu +4 more
openalex +3 more sources
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES
A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same.
Aditya Ambarwati, Vira Hari Krisnawati
doaj +1 more source
Optimization of 4-Amino-2-Pyridone Inhibitors of Proprotein Convertase Subtilisin/Kexin Type 9: Integrating Structure-Activity and Structure-Metabolism Relationships. [PDF]
Green chemistry‐based late‐stage functionalization (LSF) of the anti‐proprotein convertase subtilisin/kexin type 9 (PCSK9) early lead compound 5c led to optimized analogs with improved metabolic stability/PCSK9 IC50 ratio. Proprotein convertase subtilisin/kexin type 9 (PCSK9) is a key drug target for the treatment of different hypercholesterolemia ...
Giannessi L +12 more
europepmc +2 more sources

