Results 121 to 130 of about 580,793 (206)

On Sombor index and graph energy of some chemically important graphs

open access: yesExamples and Counterexamples
Sombor index of a graph G=(V(G),E(G)) is provided by the expression ∑uv∈E(G)du2+dv2, where dx is the degree of the vertex x∈V(G). The energy of a graph is the quantity given by the total of the absolute values of its adjacency matrix’s eigenvalues.
Md Selim Reja, Sk. Md. Abu Nayeem
doaj   +1 more source

Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]

open access: yesMolecules, 2022
Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc   +1 more source

An Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graph

open access: yes, 2012
We derive an upper bound on the largest signless Laplacian eigen­value of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained re­moving the edges of the unique cycle in the ...
Rojo, Oscar   +2 more
core   +1 more source

On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]

open access: yesComput Intell Neurosci, 2022
Xu G, Sun Q, Liang Z.
europepmc   +1 more source

The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two

open access: yesOpen Mathematics
The number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj   +1 more source

On detour index of cycloparaphenylene and polyphenylene molecular structures. [PDF]

open access: yesSci Rep, 2021
Prabhu S   +4 more
europepmc   +1 more source

Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]

open access: yesEntropy (Basel), 2022
Ali F   +4 more
europepmc   +1 more source

Local Multiset Dimension of Amalgamation Graphs. [PDF]

open access: yesF1000Res, 2023
Alfarisi R   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy