Results 41 to 50 of about 143,498 (274)

Sufficient Conditions for Hamiltonicity of Graphs with Respect to Wiener Index, Hyper-Wiener Index, and Harary Index

open access: yesJournal of Chemistry, 2019
In this paper, with respect to the Wiener index, hyper-Wiener index, and Harary index, it gives some sufficient conditions for some graphs to be traceable, Hamiltonian, Hamilton-connected, or traceable for every vertex.
Guisheng Jiang, Lifang Ren, Guidong Yu
doaj   +1 more source

Some distance based indices of graphs based on four new operations related to the lexicographic product

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u,
N. Dehgardi   +2 more
doaj   +1 more source

Steiner Wiener index of Line graphs

open access: yesIndian Journal of Pure and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. A. Rasila, Ambat Vijayakumar
openaire   +1 more source

On the difference between the Szeged and Wiener index

open access: yes, 2016
We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if $G$ is a 2-connected non-complete graph on $n$ vertices, then $Sz(G)-W(G)\ge 2n-6$.
Bonamy, Marthe   +4 more
core   +2 more sources

The edge-Wiener index and the edge-hyper-Wiener index of phenylenes [PDF]

open access: yesDiscrete Applied Mathematics, 2019
Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in the recent years.
openaire   +2 more sources

Post‐COVID Fatigue Is Associated With Reduced Cortical Thickness After Hospitalization

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Neuropsychiatric symptoms are among the most prevalent sequelae of COVID‐19, particularly among hospitalized patients. Recent research has identified volumetric brain changes associated with COVID‐19. However, it currently remains poorly understood how brain changes relate to post‐COVID fatigue and cognitive deficits.
Tim J. Hartung   +190 more
wiley   +1 more source

The Wiener index of signed graphs [PDF]

open access: yesApplied Mathematics and Computation, 2022
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of olt{ }s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being $G=C_{11}$. We relax this problem by defining a notion of Wiener indices for signed graphs, which we denote by $W_ (G ...
openaire   +3 more sources

Adjustment of Coatings Morphology and Particle Distribution of Layered Silicates by Freeze‐Drying for Improved Gas Barriers

open access: yesAdvanced Engineering Materials, EarlyView.
Freeze‐drying of layered silicate is the key to get coatings with superior gas barrier. Freeze‐drying of layered silicates modified with dodecylamine (DDA) is a highly effective technique for the preparation of barrier pigments that significantly mitigate the permeation of oxygen, water vapor, and hydrogen through polymer films containing these ...
Joshua Lommes   +4 more
wiley   +1 more source

Is Young's Modulus a Critical Coating Property Determining Fouling‐Release Performance of Marine Coatings?

open access: yesAdvanced Engineering Materials, EarlyView.
The release of foulers from protective marine coatings is determined by several interrelated material properties, including the strength of Young's modulus, the flexibility of chain segments, the surface free energy, and the magnitude of hydrodynamic stress.
Johann C. Schaal   +2 more
wiley   +1 more source

Wiener Polynomials for Multi-Rings Paraffin Structures [PDF]

open access: yesAl-Rafidain Journal of Computer Sciences and Mathematics, 2007
The distance between any two vertices u and v in a connected graph G is defined as the length of the shortest path between them, and it is denoted by d(u,v).The sum of distances for all unordered pairs of distinct vertices in G represents Wiener index ...
Ahmed Ali
doaj   +1 more source

Home - About - Disclaimer - Privacy