Results 31 to 40 of about 3,737,056 (274)
Wiener index of graphs with fixed number of pendant or cut-vertices [PDF]
, 2022 summary:The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices.
Pandey, Dinesh, Patra, Kamal Lochan
core +1 more source
Wiener, edge-Wiener, and vertex-edge-Wiener index of Basilica graphs
Discrete Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matteo Cavaleri +3 more
openaire +3 more sources
The Wiener-Hopf-Hilbert technique applied to problems in diffraction [PDF]
, 1999 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.A number of diffraction problems which have practical applications are examined using the Wiener-Hopf-Hilbert technique.
Barton, Peter
core +5 more sources
Hosoya and Harary Polynomials of TOX(n),RTOX(n),TSL(n) and RTSL(n)
Discrete Dynamics in Nature and Society, 2019 In the fields of chemical graph theory, topological index is a type of a molecular descriptor that is calculated based on the graph of a chemical compound.
Lian Chen +5 more
doaj +1 more source
Sharp bounds and normalization of Wiener-type indices. [PDF]
PLoS ONE, 2013 Complex networks abound in physical, biological and social sciences. Quantifying a network's topological structure facilitates network exploration and analysis, and network comparison, clustering and classification.
Dechao Tian, Kwok Pui Choi
doaj +1 more source
Hosoya polynomial of zigzag polyhex nanotorus [PDF]
Journal of the Serbian Chemical Society, 2008 The Hosoya polynomial of a molecular graph G is defined as ... , where d(u,v) is the distance between vertices u and v. The first derivative of H(G,l) at l = 1 is equal to the Wiener index of G, defined as .... . The second derivative of .... at l = 1 is
MEHDI ELIASI, BIJAN TAERI
doaj +3 more sources
On the Wiener Index of Orientations of Graphs
Discrete Applied Mathematics, 2022 The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$ to a vertex $b$ as $0$ if there is no path from $a$ to $b$ in $D$.
openaire +4 more sources
Note of the hyper-Wiener index [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2, over all pairs υ,ν 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 υ and ν.
Gutman Ivan +2 more
doaj +1 more source
On the Graovac-Pisanski index [PDF]
Kragujevac Journal of Science, 2017 The Graovac-Pisanski index (GP index) is an algebraic approach for generalizing the Wiener index. In this paper, we compute the difference between the Wiener and GP indices for an infinite family of polyhedral graphs.
Hakimi-Nezhaad Mardjan +1 more
doaj +1 more source
Mathematical aspects of Wiener index
Ars Mathematica Contemporanea, 2016 The Wiener index (i.e., the total distance or the transmission number), defined as the sum of distances between all unordered pairs of vertices in a graph, is one of the most popular molecular descriptors. In this article we summarize some results, conjectures and problems on this molecular descriptor, with emphasis on works we were involved in.
Martin Knor +2 more
openaire +5 more sources