Results 161 to 170 of about 4,390 (196)

Bicyclic graphs with extremal cover cost

Applied Mathematics and Computation, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, Jian, Pan, Xiang-Feng, Liu, Huiqing
openaire   +1 more source

Reduced Sombor index of bicyclic graphs

Asian-European Journal of Mathematics, 2021
The concept of Sombor indices (SO) of a graph was recently introduced by Gutman and the reduced Sombor index [Formula: see text] of a graph [Formula: see text] is defined by [Formula: see text] where [Formula: see text] is the degree of the vertex [Formula: see text].
Shiikhar Dorjsembe, Batmend Horoldagva
openaire   +2 more sources

On Bicyclic Graphs with Maximal Graovac-Ghorbani Index

Match Communications in Mathematical and in Computer Chemistry, 2023
Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 429-448] conjectured a sharp lower and upper bounds to the Graovac-Ghorbani index for all bicyclic graphs. Motivated by their nice work, in this paper we determine the maximal Graovac-Ghorbani index of bicyclic ...
Song, Rui, Liu, Saihua, Ou, Jianping, Cui, Jianbin   +3 more
openaire   +1 more source

Minimal configuration bicyclic graphs

Linear and Multilinear Algebra, 2012
The nullity η(G) of a graph G is the multiplicity of zero as an eigenvalue of the adjacency matrix of G. If η(G) = 1, then the core of G is the subgraph induced by the vertices associated with the nonzero entries of the kernel eigenvector. The set of vertices which are not in the core is the periphery of G.
openaire   +1 more source

Bicyclic graphs with minimum energy

Linear and Multilinear Algebra, 2001
If λ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
openaire   +1 more source

On bicyclic graphs with minimal energies

Journal of Mathematical Chemistry, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Jianbin, Zhou, Bo
openaire   +2 more sources

Unbalanced unicyclic and bicyclic graphs with extremal spectral radius

Czechoslovak Mathematical Journal, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belardo F., Brunetti M., Ciampella A.
openaire   +3 more sources

Degree Kirchhoff Index of Bicyclic Graphs

Canadian Mathematical Bulletin, 2017
AbstractLet G be a connected graph with vertex set V(G).The degree Kirchhoò index of G is defined as S'(G) = Σ{u,v}⊆V(G) d(u)d(v)R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between vertices u and v. In this paper, we characterize the graphs having maximum and minimum degree Kirchhoò index among all n ...
Zikai Tang, Hanyuan Deng
openaire   +1 more source

On Randić indices of trees, unicyclic graphs, and bicyclic graphs

International Journal of Quantum Chemistry, 2011
AbstractThe Randić (connectivity) index is one of the most successful molecular descriptors in structure‐property and structure‐activity relationships studies. We determine the n‐vertex trees with the third for n ≥ 7, the fourth for n ≥ 10, the fifth and the sixth for n ≥ 11 maximum Randić indices, unicyclic graphs with the third for n ≥ 5, the fourth ...
Zhibin Du, Bo Zhou
openaire   +1 more source

Trees, unicyclic graphs and bicyclic graphs with exactly two Q-main eigenvalues

Acta Mathematica Sinica, English Series, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin, Huang, Qiong Xiang
openaire   +1 more source