Results 31 to 40 of about 1,735,900 (276)
Steiner Wiener index of graph products [PDF]
Transactions on Combinatorics, 2016 The Wiener index W(G) of a connected graph G is defined as W(G)=∑u,v∈V(G)dG(u,v) where dG(u,v) is the distance between the vertices u and v of G.
Yaoping Mao, Zhao Wang, Ivan Gutman
doaj
Algorithms, 2023 With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency.
Yusef Ahsini +6 more
doaj +1 more source
The geometric dilation of three points
Journal of Computational Geometry, 2019 Given three points in the plane, we construct the plane geometric network of smallest geometric dilation that connects them. The geometric dilation of a plane network is defined as the maximum dilation (distance along the network divided by Euclidean ...
Annette Ebbers-Baumann +3 more
doaj +1 more source
Extremal values for Steiner distances and the Steiner $k$-Wiener index
, 2023 Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend several theorems on the middle parts and extremal values of trees from their regular distance variants to their Steiner
Wang, Hua, Zhang, Andrew
openaire +2 more sources
Data‐Guided Photocatalysis: Supervised Machine Learning in Water Splitting and CO2 Conversion
Advanced Intelligent Discovery, EarlyView.This review highlights recent advances in supervised machine learning (ML) for photocatalysis, emphasizing methods to optimize photocatalyst properties and design materials for solar‐driven water splitting and CO2 reduction. Key applications, challenges, and future directions are discussed, offering a practical framework for integrating ML into the ...
Paul Rossener Regonia +1 more
wiley +1 more source
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
Discrete Mathematics, 2008 In a connected graph \(G=(V,E)\), a set \(S\subset V\) is a (Steiner) geodetic set if all \(v\in V\) lie on some shortest path between two vertices in \(S\) (resp. some Steiner subtree for \(S\) in \(G\)). The minimum cardinality of a (Steiner) geodetic set is the (Steiner) geodetic number \(g(G)\) (resp. \(sg(G)\)).
Linda Eroh, Ortrud R. Oellermann
openaire +3 more sources
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem [PDF]
, 2023 Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g.
Spitzley, Yannik Kyle Dustin +2 more
core +3 more sources
Journal of Applied MathematicsThe prediction of molecular activity plays an important role in drug discovery. Various approaches have been devised to predict anti-HIV activity based on topological indices.
Xingfu Li
doaj +1 more source
Cephalometric Norms in an Iranian Kurdish Population According to the Steiner Analysis [PDF]
Iranian Journal of Orthodontics, 2019 Background: Cephalometric analyses norms and orthodontic software have been mainly developed for Caucasians. Thus, they might not be true for other ethnical groups.Objectives: This study sought to determine cephalometric norms of an Iranian Kurdish ...
Mohammad Moslem Imani +3 more
doaj +1 more source
American Journal of Botany, EarlyView.Abstract Premise Desert plant assemblages in southern California provide an opportunity to link patterns of community structure with climate‐driven vulnerability in a rapidly changing environment. California sustains an exceptionally diverse flora of approximately 4300 plant species, with 31% identified as endemic.
Hector Zumbado‐Ulate +4 more
wiley +1 more source