Results 111 to 120 of about 167 (150)
Kuwait Journal of Science, 2016 Topological indices play an important role in Mathematical Chemistry, especially in thequantitative structure-property relationship (QSPR) and quantitative structure-activityrelationship (QSAR) studies.
Akbar Ali +2 more
doaj
Hosoya Indices of Bicyclic Graphs
Croatica Chemica Acta, 2009 Given a molecular graph G, the Hosoya index Z(G) of G is defined as the total number of the matchings of the graph. Let Bn denote the set of bicyclic graphs on n vertices. In this paper, the minimal, the second-, the third-, the fourth-, and the fifth-minimal Hosoya indices of bicyclic graphs in the set Bn are characterized.
Li, Shuchao, Li, Xuechao, Zhu, Zhongxun
openaire +1 more source
Maximal elliptic Sombor index of bicyclic graphs [PDF]
Contributions to MathematicsFuxian Qi, Zhen Lin
doaj +1 more source
Retracted: Extremal Values of Variable Sum Exdeg Index for Conjugated Bicyclic Graphs
Journal of Chemistry, 2023 Journal of Chemistry
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2023
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
Summary: The PI index of a graph \(G\) is given by \(\operatorname{PI}(G)=\sum_{e\in E(G)} (|V(G)|-N_G(e))\), where \(N_G(e)\) is the number of equidistant vertices for the edge \(e\). Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs.
SC, Manju, K, Somasundaram
openaire +2 more sources
On the permanental sum of bicyclic graphs
Computational and Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tingzeng Wu, Kinkar Chandra Das
openaire +2 more sources
Bicyclic graphs with extremal cover cost
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Lu, Xiang-Feng Pan, Huiqing Liu
openaire +1 more source
On the k-matchings of the complements of bicyclic graphs
Discrete Mathematics, Algorithms and Applications, 2018A matching of a graph [Formula: see text] is a set of pairwise nonadjacent edges of [Formula: see text], and a [Formula: see text]-matching is a matching consisting of [Formula: see text] edges. In this paper, we characterize the bicyclic graphs whose complements have the extremal number of [Formula: see text]-matchings for all [Formula: see text].
Hong-Hai Li, Yi-Ping Liang
openaire +2 more sources
Extremal Bicyclic 3-Chromatic Graphs
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ioan Tomescu, Sana Javed
openaire +1 more source
The Hitting Times of Random Walks on Bicyclic Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaomin Zhu, Xiao-Dong Zhang 0001
openaire +2 more sources