Results 21 to 30 of about 8,370 (109)

Steiner distance in chemical graph theory

open access: yes, 2021
Steiner distance dG(S) is a natural generalization of the concept of distance in a graph. For a connected graph G of order at least 2 and S ⊆ V (G), dG(S) is equal to the minimum size among all connected subgraphs whose vertex sets are equal to the set S.
Mao, Yaping, Furtula, Boris
openaire   +1 more source

Steiner distances in generalized corona products

open access: yesAnalele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică
Abstract The Steiner distance of a subset of vertices in a graph is the minimum size among all the connected subgraphs containing this subset. This paper focuses on the study of Steiner distances in both generalized vertex corona (GVC) and generalized edge corona (GEC) products, and the relationship with their ...
R. Gurusamy   +3 more
openaire   +1 more source

From Bailout to Benchmark? Rethinking the Alfieri Procedure for Mitral Regurgitation in Barlow's Disease. [PDF]

open access: yesJ Clin Med
Steiner K   +10 more
europepmc   +1 more source

DNA barcoding of <i>Messor</i> ants of Bulgaria with insights into their taxonomic diversity. [PDF]

open access: yesBiodivers Data J
Lapeva-Gjonova A   +6 more
europepmc   +1 more source

The graded effect of propofol in electrophysiology-guided navigation during deep brain stimulation surgery. [PDF]

open access: yesNPJ Parkinsons Dis
Issabekov G   +17 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy