Results 31 to 40 of about 167 (150)

Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination

open access: yesIEEE Access, 2019
Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T in ...
Doost Ali Mojdeh   +3 more
doaj   +1 more source

On minimum revised edge Szeged index of bicyclic graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
The revised edge Szeged index [Formula: see text] of a graph G is defined as [Formula: see text] where [Formula: see text] and [Formula: see text] are, respectively, the number of edges of G lying closer to vertex u than to vertex v and the number of ...
Mengmeng Liu, Shengjin Ji
doaj   +1 more source

Sharp bounds on the additively weighted Mostar index of bicyclic graphs

open access: yesKuwait Journal of Science
The additively weighted Mostar index is a newly weighted variant of the Mostar index. Extensive studies have been conducted on the bounds of the additively weighted Mostar index of graphs.
Liju Alex   +2 more
doaj   +1 more source

On the nullity of bicyclic graphs

open access: yesLinear Algebra and its Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hu, Shengbiao   +2 more
openaire   +2 more sources

On minimum algebraic connectivity of graphs whose complements are bicyclic

open access: yesOpen Mathematics, 2019
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao   +3 more
doaj   +1 more source

The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2017
Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj   +1 more source

On Omega Index and Average Degree of Graphs

open access: yesJournal of Mathematics, 2021
Average degree of a graph is defined to be a graph invariant equal to the arithmetic mean of all vertex degrees and has many applications, especially in determining the irregularity degrees of networks and social sciences.
Sadik Delen   +3 more
doaj   +1 more source

Degree-Based Entropy of Some Classes of Networks

open access: yesMathematics, 2023
A topological index is a number that is connected to a chemical composition in order to correlate a substance’s chemical makeup with different physical characteristics, chemical reactivity, or biological activity.
S. Nagarajan   +4 more
doaj   +1 more source

On the distance spread of cacti and bicyclic graphs

open access: yesDiscrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yijuan Liang, Bo Zhou 0007
openaire   +2 more sources

Boolean Logic‐Based Control Over Recombinant Protein Biomaterial Degradability and Therapeutic Delivery

open access: yesAdvanced Materials, EarlyView.
Fully recombinant protein‐based biomaterials execute complex Boolean logic for user‐programmable material degradation and concomitant therapeutic cargo release. Biologics, such as growth factors, can be incorporated within the crosslinkers as “drugamers”, while encapsulated cells can be released according to nested YES/OR/AND‐type logical operations ...
Murial L. Ross   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy