Results 21 to 30 of about 1,735,900 (276)
The Steiner Wiener Index of A Graph
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,v∈V(G) d(u, v) where dG(u, v) is the distance between vertices u and v of G. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source
Steiner Degree Distance of Two Graph Products
The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈SdegG(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj +1 more source
Rate of cluster decomposition via Fermat-Steiner point
In quantum field theory with a mass gap correlation function between two spatially separated operators decays exponentially with the distance. This fundamental result immediately implies an exponential suppression of all higher point correlation ...
Alexander Avdoshkin +3 more
doaj +1 more source
Some results for monotonically labelled simply generated trees [PDF]
We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of $\{1, 2, \ldots, r\}$, for $r$ fixed.
Bernhard Gittenberger, Alois Panholzer
doaj +1 more source
Blake-Steiner/PhenoSoilFlux: Full 1.0 Release of Code for a Manuscript
<p>This release contains the final code for the <em>Ecosphere</em> manuscript titled, "Using Phenology to Unravel Differential Soil Water Use and Productivity in a Semiarid Savanna" by Steiner et al.</p ...
Blake Steiner
core +1 more source
Correspondence sent from Edmund F. Steiner to Reverend Boohar in response to the Reverend s recent letter. Steiner notes that to date, no violence has taken place in Milford and that the decision to remove the Black students from the school was made in ...
Steiner, Edmund
core +2 more sources
Propagation-Invariant Off-Axis Elliptic Gaussian Beams with the Orbital Angular Momentum
We studied paraxial light beams, obtained by a continuous superposition of off-axis Gaussian beams with their phases chosen so that the whole superposition is invariant to free-space propagation, i.e., does not change its transverse intensity shape ...
Alexey A. Kovalev +2 more
doaj +1 more source
More on the Minimum Size of Graphs with Given Rainbow Index
The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
Abstract Divergent thinking (DT) is an important constituent of creativity that captures aspects of fluency and originality. The literature lacks multivariate studies that report relationships between DT and its aspects with relevant covariates, such as cognitive abilities, personality traits (e.g. openness), and insight. In two multivariate studies (N
S. Weiss +6 more
wiley +1 more source
Inverse Problem on the Steiner Wiener Index
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) =∑u,v∈V (G)dG(u, v), where dG(u, v) is the distance (the length a shortest path) between the vertices u and v in G. For S ⊆ V (G), the Steiner distance d(S) of
Li Xueliang, Mao Yaping, Gutman Ivan
doaj +1 more source

