Results 41 to 50 of about 1,607 (200)
[Retracted] On Acyclic Structures with Greatest First Gourava Invariant
Let ξ be a simple connected graph. The first Gourava index of graph ξ is defined as GO1(ξ) = ∑μη∈E(ξ)[d(μ) + d(η) + d(μ)d(η)], where d(μ) indicates the degree of vertex μ. In this paper, we will find the upper bound of GO1(ξ) for trees of given diameter, order, size, and pendent nodes, by using some graph transformations.
Mariam Imtiaz +5 more
wiley +1 more source
Latitudinal, longitudinal and weather-related variation in breeding parameters of Great Reed Warblers in Europe: A meta-analysis [PDF]
Capsule Clutch initiation date decreased with longitude, clutch size increased with latitude and decreased with maximum temperature, whereas the number of fledglings increased both with latitude and longitude, and decreased with maximum temperature in 19
Lengyel, Szabolcs +2 more
core +2 more sources
[Retracted] Degree‐Based Molecular Descriptors of Guar Gum and Its Chemical Derivatives
The most abundant polycarbonates that are found in food are polysaccharides. A long chain of monosaccharide with glycosidic linkages forms polymeric carbohydrates. These carbohydrates with water in the process of hydrolysis produces sugar monosaccharides or oligosaccharides. The examples of polysaccharides include starch, galactogen, and glycogen. They
M. C. Shanmukha +5 more
wiley +1 more source
Analysis of Dendrimer Generation by Sombor Indices
Dendrimers are highly branched, star-shaped macromolecules with nanometer-scale dimensions. Dendrimers are defined by three components: a central core, an interior dendritic structure (the branches), and an exterior surface with functional surface groups.
Shahid Amin +3 more
doaj +1 more source
In this paper, we introduce the Revan-Sombor index of a graph, which is a combination of the earlier considered Revan- and Sombor-type vertex-degree-based molecular structure descriptors.
openaire +1 more source
On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth
Let G be a graph having the set of edges E(G). Represent by dG(u) the degree of a vertex u of G. The Sombor (SO) index of G is defined as SOG=∑uv∈EGdGu2+dGv2. The length of a shortest cycle in a graph G is known as the girth of G. A connected graph with the same order and size is usually referred to as a (connected) unicyclic graph.
B. Senthilkumar +6 more
wiley +1 more source
The rationale for a wider concept of Inclusive Education for teacher education: A case-study of Serbia [PDF]
Teacher education for inclusive education (IE) is recognized as vital for improving quality and equity in education globally. In the Western Balkan countries it is also part of the transition process towards joining the European Union and has attracted ...
Closs, Alison +2 more
core +1 more source
Some inequalities of reformulated and entire Inf-Sombor index [PDF]
The concept of the Sombor index was extended by Reti et. al. [1] by introducing a pSombor index which can be seen as the p norm of the vector x = (d(u), d(v)) as p → ∞, ∥x∥∞ = max{d(u), d(v)}. Inspired by this, we defined indices namely, Reformulated Inf-
Jalappa ., Manohar S H, Boregowda H S
doaj +1 more source
An Application of Sombor Index over a Special Class of Semigroup Graph
Recently, Gutman introduced a class of novel topological invariants named Sombor index which is defined asSOG=∑uv∈EGdu2+dv2. In this study, the Sombor index of monogenic semigroup graphs, which is an important class of algebraic structures, is calculated.
Seda Oğuz Ünal
doaj +1 more source

