Results 161 to 170 of about 1,782 (193)
On the Laplacian spectral radii of bicyclic graphs
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia-Yu Shao
exaly +2 more sources
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
On the spectral moment of quasi-bicyclic graphs
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingqing Zhai
exaly +3 more sources
Degree distance of unicyclic and bicyclic graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragan Stevanovic +2 more
exaly +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
Bicyclic graphs with minimum energy
Linear and Multilinear Algebra, 2001If λ1, λ2,…,λn are the eigenvalues of a graph G, then the energy of this graph is denned as . For n⩾6, let be the graph obtained by joining n−5 pendant vertices to a vertex of degree three of the complete bipartite graph K 2. We show that for all values of n⩾6, S 4,4 n has the minimal energy among all n vertex connected bicyclic graphs with at most one
Hou Yaoping
exaly +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