Results 61 to 70 of about 4,539,869 (304)
Wiener Polynomials for Multi-Rings Paraffin Structures [PDF]
Al-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
Discrete Applied Mathematics, 2019 This paper is concerned with the strong product G ⊠ H of two graphs, G and H , and bounds on the Wiener index, Hosoya polynomial and the average eccentricity in this family of graphs. We first introduce the distance sequence of a connected graph.
R. M. Casablanca, P. Dankelmann
semanticscholar +1 more source
The maximum Wiener index of maximal planar graphs [PDF]
Journal of combinatorial optimization, 2019 The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an n -vertex maximal planar graph is at most $$\lfloor \frac{1}{18}(n^3+3n^2)\rfloor $$ ⌊ 1 18 ( n 3
Debarun Ghosh +4 more
semanticscholar +1 more source
Dementia Incidence in Individuals With Parkinson's Disease in the Framingham Heart Study
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Limited information exists on incident dementia in individuals with Parkinson's disease (PD) in US community‐based samples. We examined cognitive statuses and PD diagnoses of 183 individuals in the Framingham Heart Study (FHS) to establish incident dementia, mortality rates, associations with sex, age at PD onset, and education level.
Joshi Dookhy +11 more
wiley +1 more source
Hyper-Wiener index and Laplacian spectrum [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WWW of a chemical tree T is defined as the sum of the product n1 n2 n3, over all pairs u, u of vertices of T, where n1 and n2 are the number of vertices of T, lying on the two sides of the path which connects u and u, and n3 is the
IVAN GUTMAN
doaj +3 more sources
Wiener index and Steiner 3-Wiener index of a graph
, 2018 Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-Wiener index, hence for $k=2$ we get the Wiener index. The modular graphs are graphs in which every three
Kovše, Matjaž +2 more
openaire +2 more sources
On the difference between the Szeged and Wiener index
, 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
Arthritis Care &Research, Accepted Article.Objective This study aimed to characterize cannabis product choices (cannabinoid content and formulation) among rheumatology patients, and their associations with patient factors, patient reported perceived side effects and positive impacts. Methods An online survey (delivered from March to November 2022) was distributed by Alberta Health Services to ...
Susan Zhang +10 more
wiley +1 more source
The Hyper-Wiener Index of Trees of Order n with Diameter d
Discrete Dynamics in Nature and Society, 2016 The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index WW(G) is defined as WW(G)=1/2∑u,v∈VGdGu,v+dG2u,v with the summation going over all pairs of ...
Gaixiang Cai +4 more
doaj +1 more source
The Wiener and Terminal Wiener indices of trees [PDF]
, 2013 Heydari \cite{heydari2013} presented very nice formulae for the Wiener and terminal Wiener indices of generalized Bethe trees. It is pity that there are some errors for the formulae.
Chen, Ya-Hong, Zhang, Xiao-Dong
core